Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1998-07-09
2001-07-24
Alam, Hosain T. (Department: 2172)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
06266663
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to computer-implemented database systems, and, in particular, to user-defined search in Relational Database Management Systems.
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. 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.
The most important features for RDBMSs are storing information efficiently and reliably and retrieving the stored information within the response criteria with high efficiency. A major challenge for RDBMSs is to provide a model and implement a technique so that user-defined data (i.e., data which is based on user-defined types and which is not known to the RDBMS when the RDBMS is built) qualified by user-defined functions (i.e., functions that are defined by a user and that are not known to the RDBMS when the RDBMS is built) can be located quickly and efficiently. It is extremely important that the model takes a consistent approach with the existing RDBMS search technique, so that the model can take advantage of the existing RDBMS and can be easily integrated into the existing RDBMS.
Therefore, there is a need in the art for an improved model for user-defined search in Relational Database Management Systems.
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 model for user-defined search in Relational Database Management Systems.
In accordance with the present invention, a statement is executed in a database stored on a data storage device connected to a computer. Data that is qualified by user-defined functions is located based on a model that supports user-defined search.
An object of the invention is provide a model to efficiently locate user-defined data qualified by user-defined functions. It is another object of the invention to ensure that the model works with an existing RDBMS.
REFERENCES:
patent: 4531186 (1985-07-01), Knapman
patent: 4769772 (1988-09-01), Dwyer
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: 5437027 (1995-07-01), Bannon 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: 5701400 (1997-12-01), Amado
patent: 5754841 (1998-05-01), Carino, Jr.
patent: 5857182 (1999-01-01), DeMichiel et al.
patent: 5950190 (1999-09-01), Yeager et al.
patent: 5966695 (1999-10-01), Melchione et al.
patent: 6006214 (1999-12-01), Carey et al.
patent: 6006220 (1999-12-01), Haderle et al.
patent: 6065013 (2000-05-01), Fuh et al.
patent: 6192358 (2001-02-01), Fuh et al.
patent: 0 650 131 A1 (1995-04-01), None
Johman et al., “Extensions to Starburst: objects, types, functions, and rules” Communications of the ACM, vol. 34, No. 10, pp. 94-109, Oct. 1991.*
“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, pp. 198-209, Tsukuba, Japan, (Mar. 1997).
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. 144-162 (abstract), (Sep. 1996).
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 Database Systems”, Inform Systems, vol. 7, No. 2, pp. 123-137 (1982).
Fuh Gene Y. C.
Jou Michelle Mei-Chiou
Lee Daniel T.
Li Ping
Pan Hsin
Alam Hosain T.
Corrielus Jean M.
Foerster Ingrid
International Business Machines - Corporation
Komanduri Janaki
LandOfFree
User-defined search using index exploitation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with User-defined search using index exploitation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and User-defined search using index exploitation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2440833