System, method, and program for using duplicated direct pointer

Details System, method, and program for using duplicated direct pointer System, method, and program for using duplicated direct pointer

1996-05-20

1999-03-09

Black, Thomas G.

Data processing: database and file management or data structures

Database design

Data structure types

707200, 707202, 707204, 707100, 711100, G06F 1730

Patent

active

058813799

ABSTRACT:
The system, method, and program product of this invention allows a database management system to internally use direct and indirect pointing to locate targeted data elements that are logically related to another data element or are a target of a secondary index. By using direct and indirect pointing, the number of steps involved in a reorganization of the database can be reduced. After a reorganization, the database management system does not go back, in a separate process, to update all of the direct pointers that have pointed to segments that have moved as a result of the reorganization. Instead, the direct pointer is updated, by using the indirect pointer, only upon a first reference to the targeted data element that has moved. Each targeted data element has an entry in an indirect index where a unique identifier of the targeted data element is the key into the index. The indirect index has two direct pointer slots. Which pointer slot is used by the DBMS is determined by the odd/even reorganization number. For each reorganization, the DBMS alternates between the two portions of the indirect index to update the appropriate one of the two pointers with a new location whenever the targeted data element is moved. As a result, the indirect index contains the most recent update and the most recent previous update. If the reorganization fails, the most recent previous pointer is used to find the location of the targeted data element. Consequently, as the reorganization process is proceeding, the update to the assigned slot for the new reorganization number can be made without logging and without involving unnecessary overhead associated with maintaining direct recoverability of the keyed data records.

REFERENCES:
patent: 5222235 (1993-06-01), Hintz et al.
patent: 5408654 (1995-04-01), Barry
patent: 5412805 (1995-05-01), Jordan et al.
patent: 5481701 (1996-01-01), Chambers
patent: 5517641 (1996-05-01), Barry et al.
patent: 5555409 (1996-09-01), Leenstra et al.
patent: 5596747 (1997-01-01), Katabami et al.
patent: 5625817 (1997-04-01), Wood et al.
patent: 5721915 (1998-02-01), Sockut et al.
Boquoi, G.H.; Chan, F.M.; Horn, G.R.; Rodriguez, R.A.; "Table Object Location Linked List", IBM Technical Disclosure Bulletin, vol. 36, No. 5, May 1993, pp. 19-21.
Bulos, D., "How To Evaluate OLAP Servers", DBMS vol. 8, No. 9, p. 96, Aug. 1995, ISSN #1041-5173.
C. Baru, and D.C. Zilio, "Data Reorganization in Parallel Database Systems", Proceedings 1993 IEEE Workshop on Advances in Parallel and Distributed Systems, Oct. 6, 1993, ISBN# 8186 5250 0, pp. 102-107.
Stone, H.S., "Means for Dynamic Allocation of Sparse Tables", IBM Technical Disclosure Bulletin, vol. 32, No. 4A, Sept. 1989, pp. 214-216.

Affiliated with

Also associated with

Rating

System, method, and program for using duplicated direct pointer 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, method, and program for using duplicated direct pointer , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System, method, and program for using duplicated direct pointer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1332537