Patent
1995-03-17
1998-02-10
Amsbury, Wayne
395618, G06F 1730
Patent
active
057179212
ABSTRACT:
The present invention includes an approach to index tree structure changes which provides high concurrency while being usable with many recovery schemes and with many varieties of index trees. The present invention permits multiple concurrent structure changes. In addition, all update activity and structure change activity above the data level executes in short independent atomic actions which do not impede normal database activity. Only data node splitting executes in the context of a database transaction. This feature makes the approach usable with the diverse recovery mechanisms, while only impacting concurrency in a modest way. Even this impact can be avoided by re-packaging the atomic actions, at the cost of requiring more from the recovery system.
REFERENCES:
patent: 4914569 (1990-04-01), Levine et al.
patent: 5123104 (1992-06-01), Levine et al.
patent: 5261088 (1993-11-01), Baird et al.
patent: 5276872 (1994-01-01), Lomet et al.
patent: 5475837 (1995-12-01), Ishak et al.
Comer, Douglas, "Ubiquitous B-Tree," Computer Surveys, vol. 11, No. 2, Jun. 1979, pp. 121-136. Acta Informatica, vol. 9 (1977) pp. 1-21. Consistency and Predicate Locks in a Database System. Communications of ACM vol. 19, No. 11 (Nov. 1976) pp. 624-633. hB-Tree for Node Consolidation and Concurrency. (in preparation). Granularity of Locks and Degrees of Consistency in a Shared Database. IFIP Working Conf. on Modeling of Data Base Management Systems, (1976) pp. 1-29. (Unavailable). Concepts, (in preparation). on B-Trees. ACM Trans on Database Systems, vol. 6, No. 4 (Dec. 1981) pp. 650-670. atomic actions. Proc. ACM Conf. on Language Design for Reliable Software, Sigplan Notices 12, 3 (Mar. 1977) pp. 128-137. Trans. on Software Engineering, vol. SE-6, No. 3 (May 1980) pp. 297-304. Logs. Digital Equipment Corp. Technical Report CRL90/4 (Oct. 1990) Cambridge Research Lab, Cambridge, MA. Proc. ACM SIGMOD Conf. 1989, Portland, OR, pp. 315-324. Database Systems, vol. 15, No. 4 (Dec. 1990). Locking and Parial Rollbacks Using Write-Ahead Logging. IBM Research Report RJ 6649, (Jan. 1989) IBM Almaden Research Center, San Jose, CA. Concurrency Index Management Method Using Write-Ahead Logging. IBM Research Report RJ 6846, (Aug. 1989) IBM Almaden Research Center, San Jose, CA. Journal of Computer and System Sciences, vol. 33, No. 2 (1986) pp. 275-296. University Technical Report TR BS-85-21 (1985), Boston, MA. Trans. on Database Systems, vol. 13, No. 1 (Mar. 1988) pp. 53-90.
Lomet et al., "A Robust Multi-Attribute Search Structures", Proceedings Fifth International Conference on Data Engineering IEEE, pp. 296-304, Feb. 1989.
Chang et al., "A New Class of Node-Splitting Problems and Applications", 1989 IEEE International Symposium on Circuits and Systems (IEEE CD-ROM), pp. 309-312, May 1989.
Mancini et al., "Replication within Atomic Actions and Conversations:A Case Study in Fault-Tolerence Duality", IEEE on CD-ROM, pp. 454-461, 1989.
Lomet David
Salzberg Betty
Amsbury Wayne
Digital Equipment Corporation
Fisher Arthur W.
Pappas Joanne N.
Robinson Greta L.
LandOfFree
Concurrency and recovery for index trees with nodal updates usin does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Concurrency and recovery for index trees with nodal updates usin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concurrency and recovery for index trees with nodal updates usin will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2086689