-
公开(公告)号：JP2003330964A
公开(公告)日：2003-11-21
申请号：JP2003100031
申请日：2003-04-03
Inventor： AGARWAL RAMESH C , BHATTACHARJEE BISHWARANJAN , CRANSTON LESLIE A , HURAS MATTHEW A , LAI TONY WEN HSUN , MALKEMUS TIMOTHY R , PADMANABHAN SRIRAM K
CPC classification number: G06F17/30592 , Y10S707/954 , Y10S707/957
Abstract: PROBLEM TO BE SOLVED: To provide a multidimensional clustered table efficiently performing a processing and maintenance in a relational database management system. SOLUTION: The multidimensional clustered table is a table simultaneously clustered, at least, in a single independent dimension, namely a clustering key and physically compiled on a block, namely, a page on a disk. At least, a single key is specified for preparing the multidimensional clustered table as the dimension depending when data of the multidimensional clustered table are clustered. The respective dimensions are composed of one or more columns. An efficient collating method and a maintenance method used with the multidimensional clustered table are also provided. COPYRIGHT: (C)2004,JPO
Abstract translation: 要解决的问题：提供在关系数据库管理系统中有效执行处理和维护的多维集群表。 解决方案：多维集群表是至少在单个独立维度上同时聚集的表，即集群密钥，并在块上物理编译，即磁盘上的页面。 至少，根据多维聚簇表的数据是否聚类，指定单个密钥来准备多维聚簇表作为维度。 相应的尺寸由一个或多个列组成。 还提供了一种与多维聚类表一起使用的有效整理方法和维护方法。 版权所有（C）2004，JPO
-
公开(公告)号：CA2159270A1
公开(公告)日：1997-03-28
申请号：CA2159270
申请日：1995-09-27
Applicant: IBM CANADA
Inventor： KOLLAR LUBOR J , JHINGRAN ANANT D , MALKEMUS TIMOTHY R , PADMANABHAN SRIRAM K
IPC: G06F16/245 , G06F16/182 , G06F17/30
-
公开(公告)号：CA2427071A1
公开(公告)日：2004-10-28
申请号：CA2427071
申请日：2003-04-28
Applicant: IBM CANADA
Inventor： LINDSAY BRUCE G , BHATTACHARJEE BISHWARANJAN , PADMANABHAN SRIRAM K , MALKEMUS TIMOTHY R , HURAS MATTHEW A , MCARTHUR CATHERINE S , CRANSTON LESLIE A , WINER MICHAEL J
Abstract: An information retrieval system and method of operation therefor, wherein a plurality of dimensions for a table are identified, and at least one block in a plurality of blocks in the table is associated with a dimension value for each dimension in the plurali ty of dimensions, where each block comprises a plurality of contiguous storage pages. Additionally, the at least one block can be further associated with an associated cell, wherein t he associated cell has a unique combination of dimension values comprising an associated dimension value for each dimension in the plurality of dimensions. A unique associated bit list for each dimension value for each dimension in the plurality of dimensions has a uniq ue corresponding list entry for each block associated with that dimension value , and a unique associated bit list for each cell has a unique corresponding list entry for each block associated with that cell. These unique associated bit lists facilitate searching, insertion and deletion of records. Each list entry in the unique associated bit lists may also have an associated storage space indicia bit for its associated block for indicating whether the block is likely to be full for further facilitating insertion of records and management of data storage space. Each block may also have a unique associated empty page bitmap for indicating whe n pages in the block are empty and for identifying when the entire block is empty so that t he block may be disassociated from its associated dimension values and associated cell.
-
公开(公告)号：CA2427071C
公开(公告)日：2010-07-06
申请号：CA2427071
申请日：2003-04-28
Applicant: IBM CANADA
Inventor： CRANSTON LESLIE A , BHATTACHARJEE BISHWARANJAN , HURAS MATTHEW A , LINDSAY BRUCE G , MALKEMUS TIMOTHY R , MCARTHUR CATHERINE S , PADMANABHAN SRIRAM K , WINER MICHAEL J
IPC: G06F16/22
Abstract: An information retrieval system and method of operation therefor, wherein a plurality of dimensions for a table are identified, and at least one block in a plurality of blocks in the table is associated with a dimension value for each dimension in the plurality of dimensions, where each block comprises a plurality of contiguous storage pages. Additionally, the at least one block can be further associated with an associated cell, wherein the associated cell has a unique combination of dimension values comprising an associated dimension value for each dimension in the plurality of dimensions. A unique associated bit list for each dimension value for each dimension in the plurality of dimensions has a unique corresponding list entry for each block associated with that dimension value, and a unique associated bit list for each cell has a unique corresponding list entry for each block associated with that cell. These unique associated bit lists facilitate searching, insertion and deletion of records. Each list entry in the unique associated bit lists may also have an associated storage space indicia bit for its associated block for indicating whether the block is likely to be full for further facilitating insertion of records and management of data storage space. Each block may also have a unique associated empty page bitmap for indicating when pages in the block are empty and for identifying when the entire block is empty so that the block may be disassociated from its associated dimension values and associated cell.
-
Patent Agency Ranking
公开(公告)号：DE69423076D1
公开(公告)日：2000-03-30
申请号：DE69423076
申请日：1994-11-08
Applicant: IBM
Inventor： COYLE JR , CHANG AMY , MALKEMUS TIMOTHY R , WILSON WALTER G
Abstract: In parallel database management systems, database update requests typically result in activity at several nodes. Rollback of all updates is required if the update of any node fails. A coordination process monitors for failure or success of updates. The coordinator further provides for distinguishing activities that have taken place at any given node from the other nodes for different database update requests. Savepoints are local. This allows rollback of a selected update without affecting nodes which did not process the update.
-
公开(公告)号：CA2414980A1
公开(公告)日：2004-06-23
申请号：CA2414980
申请日：2002-12-23
Applicant: IBM CANADA
Inventor： MALKEMUS TIMOTHY R , PADMANABHAN SRIRAM K , CHAN PETRUS K C
Abstract: A block map is associated with a multi-dimensionally clustered (MDC) base table in a database to maintain a "free" or "in use" status for each of the contiguous blocks in the table. Additionally, information may be stored in the block map to indicate whether, after loading data, a given block in the base table requires constraint checking operation or whether, based on changes to the block, a materialized query table dependent upon the table requires a refresh operation. Each time data is loaded into the table, the associated block map is updated. When delayed constraint check or refresh operations ar e to be performed, the block map is consulted to learn which blocks require the operations. After one of the constraint check or refresh operations is performed, the associat ed block map is again updated. The block map enables a method to efficiently identify dat a blocks in a base table, changes to which trigger incremental constraint checking operations and incremental maintenance operations of dependent materialized query tables.
-
公开(公告)号：DE69423076T2
公开(公告)日：2000-09-14
申请号：DE69423076
申请日：1994-11-08
Applicant: IBM
Inventor： COYLE JR , CHANG AMY , MALKEMUS TIMOTHY R , WILSON WALTER G
Abstract: In parallel database management systems, database update requests typically result in activity at several nodes. Rollback of all updates is required if the update of any node fails. A coordination process monitors for failure or success of updates. The coordinator further provides for distinguishing activities that have taken place at any given node from the other nodes for different database update requests. Savepoints are local. This allows rollback of a selected update without affecting nodes which did not process the update.
-
公开(公告)号：CA2425033A1
公开(公告)日：2004-10-08
申请号：CA2425033
申请日：2003-04-08
Applicant: IBM CANADA
Inventor： BHATTACHARJEE BISHWARANJAN , PADMANABHAN SRIRAM K , WINER MICHAEL J , CRANSTON LESLIE A , HURAS MATTHEW A , MCARTHUR CATHERINE S , MALKEMUS TIMOTHY R
Abstract: A multi-level locking hierarchy for a relational database includes a first locking level applied to a multi-dimensionally clustering table, a second locking level applied to blocks within the table, and a third locking level applied to rows within the blocks. The hierarchy leverages the multi-dimensional clustering of the table data for efficiency and to reduce lock overhead. Data is normally locked in order of coarser to finer granularity to limit deadlock. When data of finer granularity is locked, data of coarser granularity containing the finer granularity data is also locked. Block lock durations may be employed to ensure that a block remains locked if any contained row remains locked. Block level lock attributes may facilitate detection of at least one of a concurrent scan and a row deletion within a block. Detection of the emptying of a block during a scan of the block may bar scan completion in that block.
-
公开(公告)号：CA1290456C
公开(公告)日：1991-10-08
申请号：CA589118
申请日：1989-01-25
Applicant: IBM
Inventor： CHANG PHILIP Y , COYLE DANIEL J JR , MALKEMUS TIMOTHY R , RODRIGUEZ REBECCA A , WELTI PHILIP J
Abstract: AT9-88-011 In a relational database system, a method is utilized that increases the performance of the sort operation. An optimizer routine in the relational database manager analyzes a user's complete query to determine whether the final sorted results can be used directly by the user as sorting occurs. If the sort results can be used, the sort results are sent to Relational Data Services in the relational database manager for output to the user. Depending upon the determination made by the optimizer routine, one of two output modes for the final sorted sequence string of data are selected by the relational database manager. In disk output mode, the last pass of the final sorted sequence string is written to disk. In fast direct output mode, the records of data are sent to the user as the final sorted sequence string is being merged during the last pass. The system and method of this invention reduces the total sort time by eliminating the overhead of writing to disk during the fast direct output mode. Also, the response time, or availability for each record is reduced since each record is retrieved or sent to the Relational Data Services immediately after it has been sorted into the final sort order instead of completing the entire sort first, and then writing to disk.
-
-
-
-
-
-
-
-
Search Results
9
records
(took 0.02 seconds)
