System and method for cross-reference linking of local partitioned B-trees
AssigneeUnisys Corporation
InventorsKelsey L. Bruso, James M. Plasek, John C. Rust
Life of this patent
Estimating the term…
Loading patent…
AssigneeUnisys Corporation
InventorsKelsey L. Bruso, James M. Plasek, John C. Rust
Estimating the term…
A system and method for managing multiple partitions of a database are disclosed. According to one embodiment, each partition contains a subset of all records of the database, and is respectively associated with a secondary index B-tree, and a primary key B-tree. To retrieve a data record from the database, a partition is selected and a search is initiated on the associated secondary index B-tree for one or more records having a desired secondary index value. If records are so located, a primary key value obtained from one of the records is used to search the associated primary key B-tree to locate the data. In some cases, the search of the secondary index B-tree may not find the desired secondary index value within the selected partition. In these instances, pointers directed to one or more other partitions are used to locate records containing the desired secondary index value.
A method of managing a database that includes multiple partitions, each storing records containing data, the method comprising:
The method of claim 1, wherein the database is an archive database, and wherein ones of the partitions are respectively associated with an earlier-created adjacent partition, wherein for each index value stored within an earlier-created adjacent partition, at least one record exists in the respectively-associated partition storing the index value, and further including:
A method of managing records that store data of a database, comprising:
A database management system for managing a database, including:
A data processing system, comprising:
Dependencies are inferred from the claim text.