公开(公告)号：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

IPC: G06F16/22 ,  G06F17/30

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.

公开(公告)号：CA2414980A1

公开(公告)日：2004-06-23

申请号：CA2414980

申请日：2002-12-23

Applicant: IBM CANADA

Inventor： MALKEMUS TIMOTHY R ,  PADMANABHAN SRIRAM K ,  CHAN PETRUS K C

IPC: G06F16/11 ,  G06F16/21 ,  G06F17/30

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.

公开(公告)号：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

IPC: G06F16/20 ,  G06F17/30

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.