Method for concurrent record access, insertion, deletion and alt

Details Method for concurrent record access, insertion, deletion and alt Method for concurrent record access, insertion, deletion and alt

1987-10-30

1990-04-03

Lee, Thomas C.

Boots, shoes, and leggings

3642821, 3642822, 3642466, 3642468, 364300, G06F 1540

Patent

active

049145690

ABSTRACT:
A method for fetching key record data in a group or record keys according to at least a portion of a key record through an index tree is provided. The index tree provides concurrent accesses of record keys by different transactions. The index tree includes a root node connected to at least one level of nodes, each node having a key record reference to one of more nodes in a next successive level and having bottom nodes that provide access to the key data. The method consists of the steps of (1) traversing across said nodes from said root node by using said key record portion until a bottom node is reached; (2) limiting all but read accesses to the node being traversed and a previously accessed node, to other concurrent transactions; (3) identifying said key record in said bottom node; (4) limiting all but read accesses to said key record; (5) removing all access limitations to traversed nodes; (6) fetching key record data; and (7) removing the access limitation to the key record after the record data has been fetched. Further, methods for inserting and deleting record keys are provided. Additionally, a method for changing the index tree structure while allowing concurrent accesses to take place is provided.

REFERENCES:
patent: 4604694 (1986-08-01), Hough
patent: 4606002 (1986-08-01), Waisman et al.
patent: 4627019 (1986-12-01), Ng
patent: 4677550 (1987-06-01), Ferguson
patent: 4698752 (1987-10-01), Goldstein et al.
"Efficient Locking for Concurrent Operations on B-Trees", ACM Transactions on Database Systems, vol. 6, No. 4, Dec., 1981, pp. 650-670.
"Ubiquitous B-Tree", Computer Surveys, vol. 11, No. 2, Jun., 1979, pp. 121-137.
"Concurrent Operations on B-Trees with Overtaking", by Sagiv ACM Sigact-Sigmond Symposium on Principles of Database System, Mar., 1985, pp. 28-37.
"Index Locking and Splitting", IBM Technical Disclosure Bulletin, vol. 25, No. 7B, Dec., 1985, pp. 3725-3927.
"Locking Protocol for Concurrent Operations on B-Trees", IBM Technical Disclosure Bulletin, vol. 19, No. 10, Mar., 1977, pp. 3887-3889.
Data Structure and Algorithms, by Aho, Hopcroft and Ullman, Addison-Wesley Publishing Company, 1983, pp. 170-179.
"Multilevel Locking with Deadlock Avoidance", IBM Technical Disclosure Bulletin, vol. 21, No. 4, Sep., 1987, pp. 1723-1728.
"Locking Technique in a Relational Data Base: Locking on Intents", IBM Technical Disclosure Bulletin, vol. 18, No. 7, Dec., 1975, pp. 2324-2326.
"Index Mini-Pages", IBM Technical Disclosure Bulletin, vol. 25, No. 11A, Apr., 1983, pp. 5460-5463.
"Locking Mechanism for Controlling Access to Data Base Resources", IBM Technical Disclosure Bulletin, vol. 29, No. 3, Aug., 1986, pp. 1193-1195.
"Multi-Access Data Sharing Facility Utilizing Magnetic Bubble Storage", IBM Technical Disclosure Bulletin, vol. 23, No. 8, Jan., 1981, pp. 3882-3885.
"Integrated Concurrency and Shared Buffer Coherency Control for Multi-Systems", IBM Technical Disclosure Bulletin, vol. 28, No. 10, Mar., 1986, pp. 4642-4650.
"Copy Currency Control in Distributed Data Networks", IBM Technical Disclosure Bulletin, vol. 24, No. 5, Oct., 1981, pp. 2348-2351.
"Performance Without Deadlock Algorithm", IBM Technical Disclosure Bulletin, vol. 22, No. 10, Mar., 1980, p. 6759.
"Sharing of Disk Files Without Locking", IBM Technical Disclosure Bulletin, vol. 22, No. 7, Dec., 1979, pp. 2887-2889.
"Hardware-Supported Critical Sections to Minimize Process Waiting/Dispatching", IBM Technical Disclosure Bulletin, vol. 22, No. 3, Aug., 1979, pp. 1290-1293.
"Spin Queues", IBM Technical Disclosure Bulletin, vol. 18, No. 6, Nov., 1975, pp. 1953-1954.
"Locking Architecture in a Multiple Virtual Memory Multi-Processing System", IBM Technical Disclosure Bulletin, vol. 16, No. 7, Dec. 1973.
"Transaction Monitoring in Encompass (TM): Reliable Distributed Transaction Processing", by Borr, Procedures International Conference on Very Large Data Bases, Sep., 1981, pp. 244-254.
"Robustness to Crash in a Distributed Database: A Non Shared-Memory Multi-Processor Approach", by Borr, Proceedings 10th International Conference on Very Large Databases, Singapore, Aug., 1984.
"The Recovery Manager of the System R Database Manager", ACM Computing Surveys, vol. 13, No. 2, Jun., 1981, pp. 223-242.

Affiliated with

Also associated with

Rating

Method for concurrent record access, insertion, deletion and alt does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for concurrent record access, insertion, deletion and alt, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for concurrent record access, insertion, deletion and alt will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1362230