-
公开(公告)号:CA2279119A1
公开(公告)日:2001-01-29
申请号:CA2279119
申请日:1999-07-29
Applicant: IBM CANADA
Inventor: FLASZA MIROSLAW A , MCARTHUR CATHERINE S , O'CONNELL WILLIAM T , LIGHTSTONE SAM S
IPC: G06F17/30
Abstract: A computer system for the indexing of data in which a heuristic determinatio n function is applied to predict an efficient index updating approach. The system is able to updat e an index relating to a first data set by incrementally updating the index or by a rebuild of the index at the completion of the addition of a second set of data to the first set of data. The system applies a heuristic determination function to the characteristics of the first set of data, its index, and the second set of data, to predict whether an incremental update or a rebuild update of the index will result in a more efficient rebuild of the data. The system applies this approach to a restore and rollforward recovery or a data load operation to improve the efficiency of these operations.
-
公开(公告)号:CA2369621C
公开(公告)日:2009-06-09
申请号:CA2369621
申请日:2002-01-25
Applicant: IBM CANADA
Inventor: WINER MICHAEL J , ZHENG ROGER L Q , HURAS MATTHEW A , GOSS JEFFREY J , FLASZA MIROSLAW A , POSNER SARAH , MEADOWCROFT LORYSA M , MCARTHUR CATHERINE S
Abstract: The present invention is directed at a method and apparatus for handling resource transaction requests. By marking a waiting transaction request, having an access mode which is incompatible with the access mode of at least one of the executing transactions, with an ignore bit, a subsequent transaction request with an access mode compatible with the access mode(s) o f the executing transaction(s) may receive access to the resource. The subsequent transactio n request is then marked with a bypass indicator such that when the executing transactions are finish ed accessing the resource, the waiting transaction request may be notified it may have access to the resource. By including the ignore bit, each subsequent transaction request which arrives after ignore b it has been set, does not suffer from starvation.
-
公开(公告)号:CA2415018C
公开(公告)日:2006-09-19
申请号:CA2415018
申请日:2002-12-23
Applicant: IBM CANADA
Inventor: LEITCH MARK D , LIGHTSTONE SAM S , LAU LEO TAT MAN , BERKS ROBERT T , FLASZA MIROSLAW A , TREMAINE DAVID
IPC: G06F16/22 , G06F3/06 , G06F12/06 , G06F12/0882
Abstract: Loading input data into a multi-dimensional clustering (MDC) table or other structure containing data clustered along one or more dimensions entails assembling blocks of data in a partial block cache in which each partial block is associated with a distinc t logical cell. A minimum threshold number of partial blocks may be maintained. Partial blocks may be spilled from the partial block cache to make room for new logical cells. Last partia l pages of spilled partial blocks may be stored in a partial page cache to limit I/O if the cel l associated with a spilled block is encountered later in the input data stream. Buffers may be reassign ed from the partial block cache to the partial page cache if the latter is filled. Parallelism m ay be employed for efficiency during sorting of input data subsets and during storage of blocks to secondary storage.
-
公开(公告)号:CA2427216A1
公开(公告)日:2004-10-30
申请号:CA2427216
申请日:2003-04-30
Applicant: IBM CANADA
Inventor: HORNIBROOK JOHN F , STORM ADAM J , ZILIO DANIELE C , FINLAY IAN R , FLASZA MIROSLAW A
Abstract: The invention improves performance of a query in a database system when a pl an for the query includes sorting an input that is at least partially sorted such that a slow materialization sort can be applied. The invention applies the slow materialization sort by determini ng a sequence of subsets in accordance with the partially sorted input. As each of the subset s is determined, the subset is output for further processing. Advantageously, the invention reduc es the waiting period for obtaining results from a sorting operation under certain circumstances.
-
公开(公告)号:CA2279119C
公开(公告)日:2004-10-19
申请号:CA2279119
申请日:1999-07-29
Applicant: IBM CANADA
Inventor: MCARTHUR CATHERINE S , FLASZA MIROSLAW A , LIGHTSTONE SAM S , O'CONNELL WILLIAM T
IPC: G06F17/30
Abstract: A computer system for the indexing of data in which a heuristic determinatio n function is applied to predict an efficient index updating approach. The system is able to updat e an index relating to a first data set by incrementally updating the index or by a rebuild of the index at the completion of the addition of a second set of data to the first set of data. The system applies a heuristic determination function to the characteristics of the first set of data, its index, and the second set of data, to predict whether an incremental update or a rebuild update of the index will result in a more efficient rebuild of the data. The system applies this approach to a restore and rollforward recovery or a data load operation to improve the efficiency of these operations.
-
公开(公告)号:CA2422161C
公开(公告)日:2009-10-06
申请号:CA2422161
申请日:2003-03-14
Applicant: IBM CANADA
Inventor: WINER MICHAEL J , LAU LEO TAT MAN , BERKS ROBERT T , ROMANUFA KERILEY K , FLASZA MIROSLAW A , HURAS MATTHEW A , SACHEDINA AAMER
Abstract: The use of a centralized version table allows for efficient object switching . Rather than synchronizing all database agents to recognize a newly created file as containing the most recent version of a given object, database agents requiring access to t he given object need only consult the centralized version table to learn file identity information. That is, the database agents consult the centralized version table to determine which of the files associated with a given object contain the most recent version of the given object. Mechanisms associated with the use of the centralized version table also provide for efficient recovery from a failure that has occurred during an object switchi ng transaction.
-
公开(公告)号:CA2422161A1
公开(公告)日:2004-09-14
申请号:CA2422161
申请日:2003-03-14
Applicant: IBM CANADA
Inventor: ROMANUFA KERILEY K , HURAS MATTHEW A , WINER MICHAEL J , FLASZA MIROSLAW A , BERKS ROBERT T , LAU LEO TAT MAN , SACHEDINA AAMER
Abstract: The use of a centralized version table allows for efficient object switching. Rather than synchronizing all database agents to recognize a newly created file as containing the most recent version of a given object, database agents requiring access to the given object need only consult the centralized version table to learn file identity information. That is, the database agents consult the centralized version table to determine which of the files associated with a given object contain the most recent version of the given object. Mechanisms associated with the use of the centralized version table also provide for efficient recovery from a failure that has occurred during an object switching transaction.
-
公开(公告)号:CA2415018A1
公开(公告)日:2004-06-23
申请号:CA2415018
申请日:2002-12-23
Applicant: IBM CANADA
Inventor: LAU LEO TAT MAN , LEITCH MARK D , FLASZA MIROSLAW A , TREMAINE DAVID , LIGHTSTONE SAM S , BERKS ROBERT T
IPC: G06F16/22 , G06F3/06 , G06F12/06 , G06F12/0882 , G06F17/30
Abstract: Loading input data into a multi-dimensional clustering (MDC) table or other structure containing data clustered along one or more dimensions entails assembling blocks of data in a partial block cache in which each partial block is associated with a distinc t logical cell. A minimum threshold number of partial blocks may be maintained. Partial blocks may be spilled from the partial block cache to make room for new logical cells. Last partia l pages of spilled partial blocks may be stored in a partial page cache to limit I/O if the cel l associated with a spilled block is encountered later in the input data stream. Buffers may be reassign ed from the partial block cache to the partial page cache if the latter is filled. Parallelism m ay be employed for efficiency during sorting of input data subsets and during storage of blocks to secondary storage.
-
公开(公告)号:CA2390849A1
公开(公告)日:2003-12-18
申请号:CA2390849
申请日:2002-06-18
Applicant: IBM CANADA
Inventor: SHARPE DAVID C , FLASZA MIROSLAW A
Abstract: A method for comparing data, and in particular character data, is disclosed. Two pieces of data are compared to determine if they are within an equivalence class based on using a dictionary sort order table with a non-unique collating sequence. If so, the pieces of data are compared using a dictionary sort order table with a uniqu e collating sequence. The comparison method may be implemented within a sorting module that receives an input data set and then uses the comparison to compare two piece s of data in the input data set at a time. The sorting module uses the result of the comparison method to sort the input data set into equivalence classes. The results of a second comparison provides data sorted within equivalence classes. The sorting modu le may provide sorting services to a database management system or to a calling program.
-
公开(公告)号:CA2383713A1
公开(公告)日:2003-10-26
申请号:CA2383713
申请日:2002-04-26
Applicant: IBM CANADA
Inventor: HURAS MATTHEW A , TREMAINE DAVID , BERKS ROBERT T , FLASZA MIROSLAW A , VALENTIN GARY , LAU LEO T M , MCARTHUR CATHERINE S , WINER MICHAEL J
IPC: G06F16/901 , G06F17/30 , G06F17/60
Abstract: The invention herein provides method and apparatus for managing attribute- tagged index entries contained in an index by assigning or tagging an index entry attribu te indicator to a newly inserted index entry (that is, at the time when a key data value is inserted into the index, the key data value becomes a newly inserted index entry and an attribute indicator i s tagged to the newly inserted index entry). The index entry can be placed anywhere within the index. Once a group of attribute-tagged index entries have been inserted into the index, the attribute identifiers can be switched off instantaneously (that is, the attribute associated with the attribute indicators is disabled). For example, an attribute identifier can be used to defer accessibility of appropriately attribute-tagged index entries until a predetermined time later when the attribute can be disabled and thus allow users to access the attribute-tagged index entries without having to remove the attribute indicators from the index).
-
-
-
-
-
-
-
-
-