Data processing: database and file management or data structures – Database design – Data structure types
Patent
1996-08-21
1999-12-28
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707101, 324606, G06F 1730
Patent
active
060094257
ABSTRACT:
A data manager of a relational database management system (RDBMS) receives a command, such as a DELETE. As the RDBMS processes this command, an index manager looks at cursor control block information about the scan position (page number, logical key position within page and log sequence number (LSN) of the page) and immediately accesses the corresponding leaf page to do the key deletion. If the page's log sequence number has not changed since the scan was positioned on it, the index manager knows precisely where the key is and deletes it right away. Even if the page's log sequence number has changed, the index manager checks to see if the key is still on the same page. Only if the key is not on that page anymore will the index manager traverse the tree from the root to locate the key. Using this same information, together with a return.sub.-- current flag in the cursor control block, the method can easily determine the next key in the sequence. The return.sub.-- current flag is set when the current key is deleted. If the leaf page's log sequence number has not changed since the deletion and the return.sub.-- current flag is set, the method of the invention establishes that the key which now resides in the same logical position as the previously deleted key is the next key, and may be returned as such. If the LSN is the same and the return.sub.-- current flag is not set, then the next key is returned following locking. If the LSN has changed but the key is still bound on the page, the next key is searched and located, a lock is asserted (if necessary) and the key is returned. Only if the page logical sequence number has changed and the previous key is no longer bound on the page will the index manager traverse the index tree to locate the next key, lock the key (if necessary) and return it.
REFERENCES:
patent: 3916387 (1975-10-01), Woodrum
patent: 4677550 (1987-06-01), Ferguson
patent: 4754326 (1988-06-01), Kram et al.
patent: 4821336 (1989-04-01), Roye
patent: 4823310 (1989-04-01), Grand
patent: 4914569 (1990-04-01), Levine et al.
patent: 4945474 (1990-07-01), Elliott et al.
patent: 4965516 (1990-10-01), Parshotam et al.
patent: 5010478 (1991-04-01), Deran
patent: 5123104 (1992-06-01), Levine et al.
patent: 5218696 (1993-06-01), Baird et al.
patent: 5230047 (1993-07-01), Frey, Jr. et al.
patent: 5237678 (1993-08-01), Kuechler et al.
patent: 5430869 (1995-07-01), Ishak et al.
patent: 5440732 (1995-08-01), Lomet et al.
patent: 5475837 (1995-12-01), Ishak et al.
patent: 5485607 (1996-01-01), Lomet et al.
patent: 5490258 (1996-02-01), Fenner
patent: 5495609 (1996-02-01), Scott
patent: 5537574 (1996-07-01), Elko et al.
patent: 5551027 (1996-08-01), Choy et al.
patent: 5551046 (1996-08-01), Mohan et al.
patent: 5560007 (1996-09-01), Thai
patent: 5694608 (1997-12-01), Shostak
patent: 5717919 (1998-02-01), Kodavalla et al.
patent: 5812996 (1998-09-01), Rubin et al.
patent: 5832508 (1998-11-01), Sherman et al.
"Aries/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes", 16th VLDB Conference, Aug. 1990, C. Mohan, pp. 1-14.
"Aries: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging", Computer Science, Jan. 19, 1989, Mohan et al., pp. 1-59.
"Commit LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems", Data Base Technology Institute, Jun. 29, 1994, C. Mohan, pp. 1-21.
"Interactions Between Query Optimization and Concurrency Control", Proc. 2nd Int'l Workshop on RIDE: Transaction and Query Processing, Feb. 1992, C. Mohan, pp. 1-9.
"NonStop SQL, A Distributed, High-Performance, High Availability Implementation of SQL", The Tandem Database Group, Apr. 1987, pp. 1-43.
"Aries/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging", Proc. SIGMOD International Conference on Management of Data, Jun. 1992, C. Mohan et al., pp. 1-10.
"Concurrency Control and Recovery Methods for B+-Tree Indexes: Aries/KVL and Aries/IM", Computer Science, Mar. 1, 1994, C. Mohan, pp. 1-44.
"Single Table Access Using Multiple Indexes: Optimization, Execution and Concurrency Control Techniques", Computer Science, Mar. 2, 1990, C. Mohan, pp. 1-15.
Black Thomas G.
International Business Machines - Corporation
Rones Charles L.
LandOfFree
System and method for performing record deletions using index sc does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for performing record deletions using index sc, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for performing record deletions using index sc will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2389681