Generalized model for the exploitation of database indexes

Details Generalized model for the exploitation of database indexes Generalized model for the exploitation of database indexes

1998-07-09

2001-06-26

Black, Thomas (Department: 2171)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

06253196

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to computer-implemented database systems, and, in particular, to a generalized model for the exploitation of database indexes.
2. Description of the 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. The tables are typically stored on direct access storage devices (DASD), such as magnetic or optical disk drives for semi-permanent storage.
Many traditional business transaction processing is done using a RDBMS. Since the inclusion of RDBMSs in business, user-defined data types and user-defined functions have been brought into RDBMSs to enrich the data modeling and data processing power. User-defined data based on the user-defined data types may include audio, video, image, text, spatial data (e.g., shape, point, line, polygon, etc.), time series data, OLE documents, Java objects, C++ objects, etc.
Records of a table in a database can be accessed using an index when searching for a particular column value or range of values. An index is an ordered set of record identifiers (IDs) (e.g., pointers) to the records with one or more key column values from the records in the table. The index is used to access each record in the database with a key value. Without an index, finding a record would require a scan (e.g., linearly) of an entire table. Indexes provide an alternate technique to accessing data in a table. Users can create indexes on a table after the table is built. An index is based on one or more columns of the table that are used to compose a key. A B-tree is a binary tree that may be used to store the record identifiers and the key values to the records in a table.
When a table contains user-defined data, conventional systems typically do not provide exploitation of database indexes. Therefore, there is a need in the art for an improved technique for exploitation of database indexes.
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 computer-implemented generalized model for the exploitation of database indexes.
In accordance with the present invention, a statement is executed in a database stored on a data storage device connected to a computer. The database contains data. A model based on pattern matching for a user-defined predicate and selection of an index exploitation rule based on a matched user-defined predicate is provided to be used for exploiting an index to retrieve data from the database.
An object of the invention is to exploit database indexes for databases containing structured data and non-structured data. Another object of the invention is to generate search ranges for user-defined predicates using built-in relations or user-defined relations. Yet another object of the invention is to recognize general patterns for index exploitation.


REFERENCES:
patent: 4531186 (1985-07-01), Knapman
patent: 4841433 (1989-06-01), Hakim et al.
patent: 5043872 (1991-08-01), Cheng et al.
patent: 5299123 (1994-03-01), Wang et al.
patent: 5327543 (1994-07-01), Miura et al.
patent: 5404510 (1995-04-01), Smith et al.
patent: 5454039 (1995-09-01), Coppersmith et al.
patent: 5544357 (1996-08-01), Huei
patent: 5546576 (1996-08-01), Cochrane et al.
patent: 5553281 (1996-09-01), Brown et al.
patent: 5590325 (1996-12-01), Kolton et al.
patent: 5604892 (1997-02-01), Nuttall et al.
patent: 5608904 (1997-03-01), Chaudhuri et al.
patent: 5619692 (1997-04-01), Malkemus et al.
patent: 5630125 (1997-05-01), Zellweger
patent: 5630127 (1997-05-01), Moore et al.
patent: 5765147 (1998-06-01), Mattos et al.
patent: 5799310 (1998-08-01), Anderson et al.
patent: 5822750 (1998-10-01), Jou et al.
patent: 5875334 (1999-02-01), Chow et al.
patent: 5893104 (1999-04-01), Srinivasan et al.
patent: 0 650 131 A1 (1995-04-01), None
“Heirarchical Data Model for a Relational Database based Geographic Information System”,IBM® Technical Disclosure Bulletin, 40(03):107-116 (Mar. 1997).
Lynch, C. et al., “Extended User—Defined Indexing with Application to Textual Databases”,Proceedings of the 14th VLDB Conference, pp. 306-317 (1988).
Rudolf Bayer, “The Universal B—Tree for Multidimensional Indexing: General Concepts”, Worldwide Computing and Its Applications, International Conference, WWCA '97, Tsukuba, Japan, (Mar. 1997), pp. 198-209.
Faloutsos, C. et al., “Fast Map: A Fast Algorithm for Indexing, Data—Mining and Visualization of Traditional and Multimedia Datasets”, Proc. of ACM SIGMOD, pp. 163-174 (May 1995).
Ouksel, M. et al., “Multidimensional B—trees: Analysis of Dynamic Behavior”, Dept. of Elec. Eng. and Computer Science, Northwestern Univ., Evanston, Ill., BIT 21, pp. 401-418 (1981).
Klaus, F. et al., “Flexible, Runtime Efficient Fector—Radix Algorithms For Multidimensional Fast Fourier Transform”, SPIE, vol. 2247, Sensors and Control for Automation, pp. 216-226 (1994).
Sang, K.S. et al., “Applicability of genetic algorithms to optimal evaluation of path predicates in object-oriented queries”, Information Processing Letters, vol. 58, No. 3, pp. 123-128 (abstract), (May 1996).
Byungwook, K. et al., “A new indexing scheme supporting multi-attribute database applications: MAX”, Journal of Systems Architecture, vol. 42, No. 2, pp. (abstract), (Sep. 1996). p. 1.
Silberschatz, A. et al., “Managing Class Types”, SPI Database of Software Technologies, 6 pages, (May 1977).
Scheuermann, P. et al., “Multidimensional B—Trees For Associative Searching In Databases Systems”, Inform. Systems, vol. 7, No. 2, pp. 123-137 (1982).

Affiliated with

Also associated with

Rating

Generalized model for the exploitation of database indexes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Generalized model for the exploitation of database indexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized model for the exploitation of database indexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2522193