Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-05-28
2002-10-22
Breene, John (Department: 2177)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06470359
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to computer-implemented database systems, and, in particular, to recovering an index on an auxiliary table.
2. Description of Related Art
Databases are computerized information storage and retrieval systems. A Relational Database Management System (RDBMS) is a database management system (DBMS) which uses relational techniques for storing and retrieving data. Relational databases are organized into tables which consist of rows and columns of data. The rows are formally called tuples or records. A database will typically have many tables and each table will typically have multiple tuples and multiple columns. Tables are assigned to table spaces. A table space is associated with direct access storage devices (DASD), and, thus, tables, are stored on DASD, such as magnetic or optical disk drives for semi-permanent storage.
A table space can be a system managed space (e.g., an operating system file system) or a database managed space. Each table space is physically divided into equal units called pages. Each page, which may contain, for example, 4K bytes, holds one or more rows of a table and is the unit of input/output (I/O). The rows of a table are physically stored as records on a page. A record is always fully contained within a page and is limited by page size. As users move towards working with image data and other large data objects, storing data in conventional records becomes difficult.
An index is an ordered set of references to the records or rows in a database file or table. The index is used to access each record in the file using a key (i.e., one of the fields of the record or attributes of the row). However, building an index for a large file can take a considerable amount of elapsed time. The process involves scanning all records in the file, extracting a key value and record identifier (rid) value from each of the records, sorting all of the key/rid values, and then building the index from the sorted key/rid values. Typically, the scanning, sorting, and index build steps are performed serially, which can be time consuming in the case of a large database file.
Traditionally, a RDBMS stored simple data, such as numeric and text data. In a traditional RDBMS, the underlying storage management has been optimized for simple data. More specifically, the size of a record is limited by the size of a page, which is a fixed number (e.g., 4K) defined by a computer developer. This restriction in turn poses a limitation on the length of columns of a table. To alleviate such a restriction, most computer developers today support a new built-in data type for storing large objects (LOBs). Large objects, such as image data, typically take up a great deal of storage space.
When a RDBMS stores LOBs, an index may be used to access the LOBs efficiently. However, when computer systems fail, the index could be corrupted or destroyed. In this case, recovery of the index, which involves rebuilding the index, can be very time consuming because each page that was allocated to storing each LOB must be read.
Therefore, there is a need in the art for an improved technique of recovering an index on an auxiliary table.
SUMMARY OF THE INVENTION
To overcome the limitations in the prior art described above, and to overcome other limitations that will become apparent upon reading and understanding the present specification, the present invention discloses a method, apparatus, and article of manufacture for a computer implemented index recovery system.
In accordance with the present invention, an auxiliary index is recovered in a database stored on a data storage device connected to a computer. An identifier is maintained in each entry of a space map that identifies a large object to which the page associated with that entry is allocated. An indicator is maintained in the entry of the space map indicating whether the page associated with that entry is the first page allocated to the large object. The identifier and the indicator in each entry of the space map are used to build the auxiliary index for locating each large object.
REFERENCES:
patent: 4509119 (1985-04-01), Gumaer et al.
patent: 4949388 (1990-08-01), Bhaskaran
patent: 4961134 (1990-10-01), Crus et al.
patent: 5043866 (1991-08-01), Myre, Jr. et al.
patent: 5222235 (1993-06-01), Hintz et al.
patent: 5247672 (1993-09-01), Mohan
patent: 5261088 (1993-11-01), Baird et al.
patent: 5291583 (1994-03-01), Bapat
patent: 5295188 (1994-03-01), Wilson et al.
patent: 5396623 (1995-03-01), McCall et al.
patent: 5408654 (1995-04-01), Barry
patent: 5416915 (1995-05-01), Mattson et al.
patent: 5418921 (1995-05-01), Cortney et al.
patent: 5418940 (1995-05-01), Mohan
patent: 5435004 (1995-07-01), Cox et al.
patent: 5452299 (1995-09-01), Thessin et al.
patent: 5455944 (1995-10-01), Haderle et al.
patent: 5517641 (1996-05-01), Barry et al.
patent: 5566329 (1996-10-01), Gainer et al.
patent: 5579499 (1996-11-01), Fecteau et al.
patent: 5579515 (1996-11-01), Hintz et al.
patent: 5630093 (1997-05-01), Holzhammer et al.
patent: 5666560 (1997-09-01), Moertl et al.
patent: 5684986 (1997-11-01), Moertl et al.
patent: 5687343 (1997-11-01), Fecteau et al.
patent: 5721915 (1998-02-01), Sockut et al.
patent: 5727197 (1998-03-01), Burgess et al.
patent: 5732402 (1998-03-01), Lehman
patent: 5737601 (1998-04-01), Jain et al.
patent: 5742806 (1998-04-01), Reiner et al.
patent: 5742810 (1998-04-01), Ng et al.
patent: 5758357 (1998-05-01), Barry et al.
patent: 5761667 (1998-06-01), Koeppen
patent: 5983213 (1999-11-01), Nakano et al.
patent: 5999943 (1999-12-01), Nori et al.
patent: 6061678 (2000-05-01), Klein et al.
patent: 6105017 (2000-08-01), Kleewein et al.
patent: 8-167852 (1996-06-01), None
IBM Technical Disclosure Bulletin, “Method For Storing Large Objects in a Relational Database,” vol. 35, No. 4A, pp. 72-75, Sep. 1992.
IBM Technical Disclosure Bulletin, “Reorganization Flags For Table Indexes,” vol. 35, No. 5, pp. 156-157, Oct. 1992.
IBM Technical Disclosure Bulletin, “Technique to Allow DB2 Utilities and Commands to Run While SQL Applications Have a Table Space Locked,” vol. 36, No. 09A, pp. 499-501, Sep. 1993.
IBM Technical Disclosure Bulletin, “Spanning Temporary Reorg Files,” vol. 36, N. 06A, p. 159, Jun. 1993.
IBM Technical Disclosure Bulletin, “Segmented Relational Database Tables,” vol., 38, No. 07, pp. 219-220, Jul. 1995.
IBM Technical Disclosure Bulletin, “Mapping a Relational Database to a Hierarchical File System,” vol. 38, No. 10, pp. 309-311, Oct. 1995.
IBM Technical Disclosure Bulletin, “Fine Granularity Locking to Support High Data Availability in a Client/Server Database Management System,” vol. 38, No. 02, pp. 143-145, Feb. 1995.
Joon Seek Kim, et al., “Mapping Parameter Estimation Using Integral Projections And Segmented Moving Objects in Object-Oriented Analysis-Synthesis Coding,” Optical Engineering, vol. 35, No. 1, pp. 156-165, Jan. 1996.
MJ Carey, et al., “Object And File Management in The EXODUS Extensible Database System,” Proceedings of Very Large Data Bases. Twelfth International Conference on Very Large Data Bases, Kyoto, Japan, pp. 91-100, Aug. 25-28, 1986.
ML McAuliffe, et al., “Towards Effective and Efficient Free Space Management,” 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, Jun. 4-6, 1996.
C. Mohan, “Disk Read-Write Optimizations and Data Integrity in Transaction Systems Using Write-Ahead Logging,” Proceedings of the Eleventh International Conference on Data Engineering (Cat. No. 95CH35724), Taipei, Taiwan, Mar. 6-10, 1995.
Ki Sik Pang, et al., “An Efficient Recovery Scheme For Large Data in Multimedia DBMS,” Journal of the Korea Information Science Society, vol. 22, No. 2, pp. 206-217, Feb. 1995.
C. Mohan, et al., “Algorithms For Flexible Space Management in Transaction Systems Supporting Fine-Granularity Locking,” Advances in Database Technology—EDBT '94. 4th International Conference on Extending Database Technology, Cambridge, UK, Mar. 28-31, 1994.
Martin Marshall, “Time Warner Big on Oracle Objec
Breene John
Pham Khanh B
Sughrue & Mion, PLLC
LandOfFree
Fast technique for recovering an index on an auxiliary table does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Fast technique for recovering an index on an auxiliary table, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast technique for recovering an index on an auxiliary table will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2954857