The functional data model and the data languages DAPLEX
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
An implementation technique for database query languages
ACM Transactions on Database Systems (TODS)
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Some high level language constructs for data of type relation
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
CONVERT: a high level translation definition language for data conversion
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
On the expressive power of query languages for relational databases
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Query optimization for CODASYL database systems
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Query processing strategies in the PASCAL/R relational database management system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
ACM SIGMOD Record
Towards an efficient evaluation of general queries: quantifier and disjunction processing revisited
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Query graphs, implementing trees, and freely-reorderable outerjoins
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Providing better support for a class of decision support queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Outerjoin simplification and reordering for query optimization
ACM Transactions on Database Systems (TODS)
A database management capability for Ada
WADAS '85 Proceedings of the second annual Washington Ada symposium on Ada: Ada in the mainstream: applications and education
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Overview of an Ada compatible distributed database manager
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Improving Federated Database Queries Using Declarative Rewrite Rules for Quantified Subqueries
Journal of Intelligent Information Systems
Algorithms and applications for universal quantification in relational databases
Information Systems - Special issue: Best papers from EDBT 2002
Universal Quantification in Relational Databases: A Classification of Data and Algorithms
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Extending the Algebraic Framework of Query Processing to Handle Outerjoins
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A Uniform Approach to Processing Temporal Queries
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Handbook of massive data sets
No regression algorithm for the enumeration of projections in SQL queries with joins and outer joins
CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
Canonical abstraction for outerjoin optimization
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Provenance for nested subqueries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
| Hi-index | 0.00 |
Most research on query processing has focussed on quantifier-free conjunctive queries. Existing techniques for processing queries with quantifiers either compile the query into a nested loop program or use variants of Codd's reduction from the Relational Calculus to the Relational Algebra. In this paper we propose an alternative technique that uses an algebra of graft and prune operations on trees. This technique provides a significant savings in space and time. We show how to transform a quantified conjunctive query into a sequence of graft and prune operations.