Efficient index versioning in multi-version databases

• US 20070118547A1
• Filed: 11/22/2005
• Published: 05/24/2007
• Est. Priority Date: 11/22/2005
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Wood, Daniel, Gupta, Monish, Lashley, Scott
• Application Number:
  US11/285,340
• Publication Number:
  US 20070118547A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2272 Management thereof

Abstract

A method and system are provided for maintaining a database index version. The database index includes a secondary node affiliated with each leaf node of the index. The secondary node stores version information for each leaf node. A pointer in a header section of the leaf node connects the leaf node to the secondary node. In addition, a status list is maintained to identify each transaction. At such time as a scan of a database index is conducted and an index item is returned, a computation is conducted using the transaction identifiers in the secondary node, the delete flag in the leaf node, and the status list contents for the scanning transaction. The computation and associated logic will determine whether to accept or reject an item. The method results in returning a correct version of the item as existed at the time of start of the scanning transaction.

Claims

1. A method for maintaining a database index version comprising:

storing an index item in a leaf node of a B-tree and storing version information of said index item in a secondary node remote from said B-tree; and

associating said leaf node of said B tree with said secondary node.

2. The method of claim 1, further comprising restricting access to said secondary node to said leaf node.

3. The method of claim 2, wherein the step of restricting access includes said index page having a pointer to designate said secondary node.

4. The method of claim 1, wherein said version information in said secondary node includes an insert identifier for each inserted index item and a delete transaction identifier for each removed index item.

5. The method of claim 1, further comprising comparing said version information in said secondary node with version information stored on a status list to determine if a transaction associated with said index item has been committed.

6. The method of claim 1, wherein said secondary node is an in-memory data structure.

7. A database comprising:

an index item adapted to be stored in a leaf node of a B-tree;

version data of said index item adapted to be stored in a secondary node remote from said B-tree; and

a pointer to connect said leaf node with said secondary node.

8. The database of claim 7, further comprising a manager adapted to restrict access to said secondary node to said leaf node.

9. The database of claim 7, wherein said version data in set secondary node includes an insert transaction identifier for each inserted index item, and a transaction delete identifier field for each removed index item.

10. The database of claim 7, wherein said version information in said secondary node is adapted to be compared with version information stored on a status list to determine if a transaction associated with an index item has been committed.

11. The database of claim 7, further comprising a manager adapted to consult a status list of all transactions in response to return of said index item from an index scan.

12. The database of claim 7, wherein said secondary node is an in-memory data structure.

13. An article comprising:

a computer useable medium embodying computer usable program code for maintaining a database index, said computer program code including;

instructions for storing an index item in a leaf node of a B-tree;

instructions for storing version information of said index item in a secondary node remote from said B-tree; and

instructions for associating said leaf node with said secondary node.

14. The article of claim 13, further comprising instructions for limiting access to said secondary node to said leaf node.

15. The article of claim 14, wherein said instructions code for limiting access includes instructions for designating said secondary node.

16. The article of claim 13, wherein said version information in said secondary node includes an insert identifier for each inserted index item and a delete transaction identifier for each removed index item.

17. The article of claim 13, further comprising instructions for comparing said version information in said secondary node with version information stored on a status list to determine if a transaction associated with an index item has been committed.

18. The article of claim 13, wherein said secondary node is an in-memory data structure.