Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1998-07-09
2001-02-20
Black, Thomas G. (Department: 2771)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06192358
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates in general to computer-implemented database systems, and, in particular, to multiple-stage evaluation of user-defined predicates.
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.
In conventional systems, user-defined functions may be used within SQL statements. However, when a function is within an SQL statement, if a table has “n” records, then the function is executed “n” times, which is inefficient. Additionally, conventional systems cannot process user-defined functions within predicates of a SQL statement (e.g., within a WHERE clause).
Therefore, there is a need in the art for improved evaluation of user-defined predicates.
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 multiple-stage evaluation of a user-defined predicate technique.
In accordance with the present invention, a statement is executed in a database stored on a data storage device connected to a computer. The statement is received containing a user-defined predicate with a user-defined function. Then, multiple-stage evaluation of the user-defined predicate is performed.
An object of the invention is to enable the use of user-defined predicates in SQL statements. Another object of the invention is to provide multiple-stage evaluation of user defined predicates.
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: 5423041 (1995-06-01), Burke et al.
patent: 5428776 (1995-06-01), Rothfield
patent: 5454039 (1995-09-01), Coppersmith et al.
patent: 5481700 (1996-01-01), Thuraisingham
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: 5640567 (1997-06-01), Phipps
patent: 5644770 (1997-07-01), Burke et al.
patent: 5691917 (1997-11-01), Harison
patent: 5721900 (1998-02-01), Banning et al.
patent: 5758146 (1998-05-01), Schiefer et al.
patent: 5758337 (1998-05-01), Hammond
patent: 5765147 (1998-06-01), Mattos et al.
patent: 5806061 (1998-09-01), Chaudhuri et al.
patent: 5826076 (1998-10-01), Bradley et al.
patent: 5864841 (1999-01-01), Agrawal 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(30):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).
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
Pan Hsin
Wang Yun
Black Thomas G.
Coby Frantz
Internatioanal Business Machines Corporation
Pretty & Schroeder, P.C.
LandOfFree
Multiple-stage evaluation of user-defined predicates does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multiple-stage evaluation of user-defined predicates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple-stage evaluation of user-defined predicates will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2606908