Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-05-28
2002-03-26
Breene, John (Department: 2177)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C709S201000
Reexamination Certificate
active
06363389
ABSTRACT:
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is related to the following co-pending and commonly-assigned patent applications:
Application Ser. No. 09/322,312, entitled “USING AN EPOCH NUMBER TO OPTIMIZE ACCESS WITH ROWID COLUMNS AND DIRECT ROW ACCESS,” filed on same date herewith, by Robert W. Lyle et al., pending;
Application Ser. No. 09/321,675, entitled “A FAST TECHNIQUE FOR RECOVERING AN INDEX ON AN AUXILIARY TABLE,” filed on same date herewith, by Robert W. Lyle et al., pending;
Application Ser. No. 09/322,292, entitled “STORING AN UNCOMPRESSED DATA LENGTH IN A LOB MAP TO SPEED SUBSTRING ACCESS WITHIN A LOB VALUE,” filed on same date herewith, by Robert W. Lyle et al., pending;
Application Ser. No. 09/322,287, entitled “A TECHNIQUE TO AVOID PROCESSING WELL CLUSTERED LOB'S DURING REORGANIZATION OF A LOB TABLE SPACE,” filed on same date herewith, by Charles R. Bonner et al., pending;
Application Ser. No. 09/322,317, entitled “AN OPTIMIZED TECHNIQUE FOR PREFETCHING LOB TABLE SPACE PAGES,” filed on same date herewith, by Charles R. Bonner et al., pending;
Application Ser. No. 09/322,698, entitled “A TECHNIQUE FOR DETERMINING AN AGE OF AN OLDEST READING TRANSACTION WITHIN A DATABASE OBJECT,” filed on same date herewith, by Robert W. Lyle et al., pending;
Application Ser. No. 09/372,315, entitled “AN EFFICIENT TECHNIQUE TO DEFER LARGE OBJECT ACCESS WITH INTERMEDIATE RESULTS,” filed on same date herewith, by Christine M. Lee et al., abandoned; and
Application Ser. No. 09/322,316, U.S. Pat. No. 6,144,970, entitled “A TECHNIQUE FOR INPLACE REORGANIZATION OF A LOB TABLE SPACE,” filed on same date herewith, by Charles R. Bonner et al.;
each of which is incorporated by reference herein.
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to computer-implemented database management systems, and, in particular, to generating unique quasi-random row identifiers that can be used as database partitioning keys.
2. Description of Related Art
A database is a collection of stored data that is organized as tables. A table consists of rows and columns of data. The rows are formally called tuples. A database will typically have many tables and each table will typically have multiple tuples and multiple columns. The tables are typically stored on direct access storage devices (DASD) such as magnetic or optical disk drives for semi-permanent storage.
In a distributed or parallel database, the data in a table can be contained in one or more database partitions. When a table is on multiple partitions, some of its tuples may be stored in one partition and some of its tuples may be stored in other partitions. Such a division of a table is called horizontal partitioning. Vertical partitioning occurs when columns are distributed among partitions. A key for identifying each local table is called a partitioning key. Computer users typically select the value of the partitioning key and perform the initial distribution of data amongst the partitions. Over time, the distribution of data may become unbalanced among the partitions. For example, some partitions may become too large, nearly exceeding their maximum size limit, and other partitions may contain small amounts of data and a great deal of unused space.
Therefore, there is a need for an improved database management system that can create partitioning keys and use those keys to evenly distribute data among partitions.
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 generating a row identification number within a computer.
In accordance with the present invention, the row identification number is associated with a row in a database. The database is stored on a data storage device connected to a computer. A unique row identification number is created by using a computer-dependent timestamp. The unique row identification number is manipulated so that the row identification number is quasi-random.
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: 5721827 (1998-02-01), Logan 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: 5767155 (1998-06-01), Nakamura
patent: 6151604 (2000-11-01), Wlaschin 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. 06Am o, 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 Availablity 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 Objects. (Testing Oracle 8's
Lyle Robert William
Yothers Jay A.
Breene John
International Business Machines - Corporation
Lewis Cheryl
Sughrue & Mion, PLLC
LandOfFree
Technique for creating a unique quasi-random row identifier does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Technique for creating a unique quasi-random row identifier, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for creating a unique quasi-random row identifier will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2819338