High concurrency and recoverable B-tree index management method

Details High concurrency and recoverable B-tree index management method High concurrency and recoverable B-tree index management method

1995-09-12

1998-05-26

Black, Thomas G.

Data processing: database and file management or data structures

Database design

Data structure types

707 2, 707 3, 707 8, 707 9, 707 10, 707100, 707201, G06F 700

Patent

active

057583560

ABSTRACT:
A database management system for accessing the same B-tree index by a plurality of transactions. When a transaction is intercepted at the intermediate stage of an index structure modification process executed by an index structure modification execution unit, the logs of the index structure modification operation at rollback is analyzed by an index structure modification operation log analysis unit. Then, an incomplete index structure change process is completed by an uncompleted index structure modification operation completion and control unit, i.e., the roll-forward operation is performed. In this manner, it is possible to provide an efficient access to the B-tree index wherein even if the tree structure modification operation by one transaction is intercepted at its intermediate stage, another transaction is allowed to access the B-tree index thereafter.

REFERENCES:
patent: 4697266 (1987-09-01), Finley et al.
patent: 4945474 (1990-07-01), Elliot et al.
patent: 5089952 (1992-02-01), Bozman
patent: 5095421 (1992-03-01), Freund
patent: 5123104 (1992-06-01), Levine et al.
patent: 5175849 (1992-12-01), Schneider
patent: 5204958 (1993-04-01), Cheng et al.
patent: 5265244 (1993-11-01), Ghosh et al.
patent: 5265245 (1993-11-01), Nordstrom et al.
patent: 5283894 (1994-02-01), Deran
patent: 5319773 (1994-06-01), Britton et al.
patent: 5319774 (1994-06-01), Ainsworth et al.
patent: 5333303 (1994-07-01), Mohan
patent: 5418947 (1995-05-01), Hsu et al.
patent: 5465328 (1995-11-01), Dievendorff et al.
patent: 5475837 (1995-12-01), Ishak et al.
patent: 5522068 (1996-05-01), Berkowitz
patent: 5560007 (1996-09-01), Thai
patent: 5568638 (1996-10-01), Hayashi et al.
patent: 5596710 (1997-01-01), Voigt
patent: 5644763 (1997-07-01), Roy
ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging, written by C. Mohan and Don Haderle in ACM Transactions on Database Systems, vol. 17, No. 1, Mar. 1992 pp. 120-131.
Lehman, P., Yao, S.B.: Efficient Locking For Concurrent Operations On B-Trees, ACM Transactions Of Database Systems, vol. 6, No. 4, Dec. 1981, pp. 650-670.
Kwong, Y.S., Wood, D.: A New Method For Concurrency On B-Trees, IEEE Transactions On Software Engineering, No. 3 pp. 211-222, May 1982.
Mohan, C., Levine, F.: ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging, ACM-SIGMOD International Conference On Management Of Data, San Diego, Jun. 1992, pp. 371-381.

Affiliated with

Also associated with

Rating

High concurrency and recoverable B-tree index management method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with High concurrency and recoverable B-tree index management method , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High concurrency and recoverable B-tree index management method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1978850