-
公开(公告)号：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.
-
公开(公告)号：DE69112694T2
公开(公告)日：1996-04-18
申请号：DE69112694
申请日：1991-04-26
Applicant: IBM
Inventor： COYLE DAN J JR , LINDSAY BRUCE G
Abstract: A method is disclosed for supporting sequential batch applications within a data processing system which permits the continued enumeration of a sequence of objects across a transaction commit, roll-back or system failure. A query is defined which specified a set of objects and a named cursor is associated with the query, each cursor including at least one scan which may be utilized to evaluate and enumerate the query. Selected cursors may be designated as persistent cursors and stored, along with the state of any associated scan(s) and a query evaluation state in a persistent cursor table (PCT) in response to a transaction commit. Thereafter, the evaluation an enumeration of the query may be reestablished at the point of a persistent cursor by utilizing the information stored within the persistent cursor table (PCT). In the event of a subsequent roll-back of a transaction prior to the next commit point the query may be reestablished at the previous commit point utilizing the information stored within the persistent cursor table (PCT). A cursor may also be designated as a restartable cursor and stored, along with all information within the persistent cursor table (PCT), in non-volatile memory. Thereafter, in the event of a system failure the evaluation and enumeration of the query may be reestablished at the point of a restartable cursor by utilizing the information stored within non-volatile memory.
-
公开(公告)号：CA2306968C
公开(公告)日：2004-11-30
申请号：CA2306968
申请日：2000-04-28
Applicant: IBM CANADA
Inventor： MCARTHUR CATHERINE , WINER MICHAEL J , LINDSAY BRUCE G
IPC: G06F17/30
Abstract: A callback to a data manager is earned out from an index manager in a query processing system for an index-data fetch to enable an index page held stabilized by an index manager to remain stabilized during predicate checking or data consumption operations. The ind ex manager locates a data identifier in an index and calls back to a data manager to access the data indicated by the data identifier. The data manager may carry out a predicate check or a data consuming operation on the data and if this is the case the index manager may access the next da ta identifier in the index when the data manager callback is complete. The index page need not be destabilized in such a case.
-
公开(公告)号：CA2281287A1
公开(公告)日：2001-03-01
申请号：CA2281287
申请日：1999-09-01
Applicant: IBM CANADA
Inventor： CRANSTON LESLIE A , HURAS MATTHEW A , HOP HING NELSON , LINDSAY BRUCE G , WINER MICHAEL J
IPC: G06F17/30
Abstract: A method of searching a table in a database management system for free space for inserting a new record into the table. The table resides in a storage media, and includes a series of pages capable of storing a plurality of records. The table has a clustering index defined in a column of the table. The new record has a new record attribute for storing in the column o f the table when the new record is stored in the table. The method comprises searching for a target page in the series of pages, the target page being selected to maintain clustering when the new record is inserted thereon. Once the target page has been located, it is searched for sufficient free space t o accommodate the new record. If sufficient free space is found on the target page, then the new record is inserted on the target page. If sufficient free space is not found on the target page, then a target neighbourhood of pages in the series of pages is searched for sufficient free space to accommodate the new record. The target neighbourhood of pages surrounds the target page. If sufficient free space is found on a page in a target neighbourhood of pages, then the new record is inserted on to this page in the target neighbourhood of pages. If sufficient free space is not found in the target neighbourhood of pages, then the methodfurther comprises searching for sufficient free space to accommodate the new record outside the target neighbourhood of pages. If sufficient free space is found outside the target neighbourhood of pages, then the new record is inserted on a non-neighbourin g page outside the target neighbourhood of pages. If sufficient free space is not found outside the target neighbourhood of pages, then a new page having the new record is appended to the end of table.
-
公开(公告)号：CA2034905A1
公开(公告)日：1991-09-28
申请号：CA2034905
申请日：1991-01-24
Applicant: IBM
Inventor： ADAIR JOHN G , COYLE DANIEL J JR , GRAFE ROBERT J , LINDSAY BRUCE G , REINSCH ROGER A , RESCH ROBERT P , SELINGER PATRICIA G
Abstract: The invention relates to a system including a first database management system for managing a database (40) including data having a first data format and a second database management system for managing a database (50) including data having a second data format. The invention is a method for converting data transmitted between the first and second database management systems, the method including the steps of sending from the first to the second database management system a command containing data in a data format native to the first database management system; and at the second database management system, converting the data in the command into a data format native to the second database management system.
-
Patent Agency Ranking
公开(公告)号：CA2302981C
公开(公告)日：2004-06-01
申请号：CA2302981
申请日：2000-03-29
Applicant: IBM CANADA
Inventor： GOSS JEFFREY J , HURAS MATTHEW A , LINDSAY BRUCE G , HOP HING NELSON
Abstract: A database table reorganization is defined to permit online access of the table during the reorganization. Records are reorganized in the database table by vacating records from a defined number of pages and then filling the pages with records in accordance with a desired ordering for the records. Temporary pointers to the new locations of moved records are us ed to prevent table scanner access to the database table from missing or duplicating records whi le scanning the database table during reorganization. Removal of the temporary pointers is synchroniz ed with the completion of scanning of all table scanners that are commenced during a time when records are being moved as part of a vacating or filling step.
-
公开(公告)号：CA2249080A1
公开(公告)日：2000-03-25
申请号：CA2249080
申请日：1998-09-25
Applicant: IBM CANADA
Inventor： WINER MICHAEL J , HOP HING NELSON , HURAS MATTHEW A , LINDSAY BRUCE G , ROMANUFA KERILEY K , GOSS JEFFREY J
IPC: G06F17/30
Abstract: A method for efficiently searching free space in a relational database management system. The method limits the search to a finite number of space map pages in the free space map. If the configured number of space map pages in the free space map are searched and a page with free space is not found for the row, the row is inserted on the last page, or if no space is available on the last page a new page is created and the row is inserted on the new page. New rows are then appended until some predefined amount of space is filled before a search is done again. As a result, insertion of a row into the database management system does not incur the worst-case cost of searching the entire free space map.
-
公开(公告)号：CA2034906C
公开(公告)日：1995-03-14
申请号：CA2034906
申请日：1991-01-24
Applicant: IBM
Inventor： DEMERS RICHARD A , LINDSAY BRUCE G , REINSCH ROGER A , ZIMOWSKI MELVIN R
Abstract: The invention establishes the context in which data exchanged between dissimilar relational database management systems can be mutually understood and preserved. The invention accomplishes this by establishing layers of descriptive information which isolate machine characteristics, levels of support software, and user data descriptions. Optimized processing is achieved by processing the different descriptor levels at different times during the development and execution of the database management systems. Minimal descriptive information is exchanged between the cooperating database management systems. For systems which match, data conversion is completely avoided. For systems which do not match, data conversion is minimized.
-
公开(公告)号：CA1304506C
公开(公告)日：1992-06-30
申请号：CA593250
申请日：1989-03-09
Applicant: IBM
Inventor： CHANG PHILIP Y , COYLE DANIEL J JR , HOWIE LAUREN D , LINDSAY BRUCE G
Abstract: AT9-88-013 SYSTEM AND METHOD FOR EFFICIENT ANALYSIS OF RELATIONAL DATABASE OBJECTS A plurality of packed descriptions is provided as a column in a table each entry containing data defining attributes associated with a different object (such as a table or view defined to the database) and all its component objects (such as related columns and indexes). Accessing the row corresponding to a particular object returns a description of all of the attributes of the object's component objects, as well as information describing the object itself. The packed description information is redundantly stored conventionally in other system catalogs for use IN at IN querying physical definitions of objects in a manner consistent with other database products. The database state information comprising the packed descriptions is retained in internal format whereas the correlative redundant information is in a user-readable external format. By denormalizing the schema for schema data whereby identifying relationships between objects is simplified, time required for compilation of statements referencing objects is substantially, reduced. All information concerning attributes of an object specified in statement and its component objects necessary, to compile the statement may thereby be fetched from the packed description field corresponding to the object in one I/O operation. Objects descriptions must otherwise be retrieved from numerous I/Os to separate system catalogs and rows collectively containing the descriptions.
-
公开(公告)号：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.
-
-
-
-
-
-
-
-
-
Search Results
18
records
(took 0.018 seconds)
