Query evaluation techniques for large databases
G Graefe - ACM Computing Surveys (CSUR), 1993 - dl.acm.org
Database management systems will continue to manage large data volumes. Thus, efficient
algorithms for accessing and manipulating large sets and sequences will be required to …
algorithms for accessing and manipulating large sets and sequences will be required to …
The volcano optimizer generator: Extensibility and efficient search
G Graefe, WJ McKenna - Proceedings of IEEE 9th international …, 1993 - ieeexplore.ieee.org
The Volcano project, which provides efficient, extensible tools for query and request
processing, particularly for object-oriented and scientific database systems, is reviewed. In …
processing, particularly for object-oriented and scientific database systems, is reviewed. In …
Optimizing queries across diverse data sources
L Haas, D Kossmann, E Wimmers, J Yang - 1997 - ilpubs.stanford.edu
Businesses today need to interrelate data stored in diverse systems with differing
capabilities, ideally via a single high-level query interface. W e present the design of a query …
capabilities, ideally via a single high-level query interface. W e present the design of a query …
Extensible query processing in Starburst
Today's DBMSs are unable to support the increasing demands of the various applications
that would like to use a DBMS. Each kind of application poses new requirements for the …
that would like to use a DBMS. Each kind of application poses new requirements for the …
[PDF][PDF] Measuring the Complexity of Join Enumeration in Query Optimization.
K Ono, GM Lohman - VLDB, 1990 - vldb.org
Introduction 314 (the second operand of the join) is the result of a join that must be
materialized in memory or-if it is too big-on disk. The heuristic saves this materialization, but …
materialized in memory or-if it is too big-on disk. The heuristic saves this materialization, but …
Starburst mid-flight: As the dust clears
The purpose of the Starburst project is to improve the design of relational database
management systems and enhance their performance, while building an extensible system …
management systems and enhance their performance, while building an extensible system …
Optimization of queries with user-defined predicates
S Chaudhuri, K Shim - ACM Transactions on Database Systems (TODS), 1999 - dl.acm.org
Relational databases provide the ability to store user-defined functions and predicates
which can be invoked in SQL queries. When evaluation of a user-defined predicate is …
which can be invoked in SQL queries. When evaluation of a user-defined predicate is …
Queries and query processing in object-oriented database systems
DD Straube, MT Özsu - ACM Transactions on Information Systems (TOIS …, 1990 - dl.acm.org
Object-oriented database mangement systems (OODBMS) combine the data abstraction
and computational models of object-oriented programming languages with the query and …
and computational models of object-oriented programming languages with the query and …
Extensions to Starburst: Objects, types, functions, and rules
GM Lohman, B Lindsay, H Pirahesh… - Communications of the …, 1991 - dl.acm.org
Relational DBMSs, prototyped in the 1970s and now common in the marketplace, gained
popularity largely because of their simple underlying concepts and high-level set-oriented …
popularity largely because of their simple underlying concepts and high-level set-oriented …
Experiences building the Open OODB query optimizer
JA Blakeley, WJ McKenna, G Graefe - Proceedings of the 1993 ACM …, 1993 - dl.acm.org
This paper reports our experiences building the query optimizer for TI's Open OODB system.
To the best of our knowledge, it is the first working object query optimizer to be based on a …
To the best of our knowledge, it is the first working object query optimizer to be based on a …