Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries
IEEE Transactions on Software Engineering
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
A basis for deductive database systems. II
Journal of Logic Programming
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Safety and correct translation of relational calculus formulas
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of deductive databases and logic programming
Logical rewriting for improving the evaluation of quantified queries
MFDBS 89 Proceedings of the second symposium on Mathematical fundamentals of database systems
The functional data model and the data languages DAPLEX
ACM Transactions on Database Systems (TODS)
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Range nesting: a fast method to evaluate quantified queries
SIGMOD '83 Proceedings of the 1983 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
Processing queries with quantifiers a horticultural approach
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases
EDBT '88 Proceedings of the 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
CSL '87 Proceedings of the 1st Workshop on Computer Science Logic
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
ACM SIGMOD Record
Proceedings of the 3rd international workshop on Statistical and scientific database management
SSDBM'86 Proceedings of the 3rd international workshop on Statistical and scientific database management
Reactive consistency control in deductive databases
ACM Transactions on Database Systems (TODS)
Parallel execution of integrity constraint checks
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Optimization and Evaluation of Disjunctive Queries
IEEE Transactions on Knowledge and Data Engineering
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
An Adaptive Algorithm for Incremental Evaluation of Production Rules in Databases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Bypassing Joins in Disjunctive Queries
VLDB '95 Proceedings of the 21th 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
Strategies for query unnesting in XML databases
ACM Transactions on Database Systems (TODS)
Kappa-join: efficient execution of existential quantification in XML query languages
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Hi-index | 0.00 |
Database applications often require to evaluate queries containing quantifiers or disjunctions, e.g., for handling general integrity constraints. Existing efficient methods for processing quantifiers depart from the relational model as they rely on non-algebraic procedures. Looking at quantified query evaluation from a new angle, we propose an approach to process quantifiers that makes use of relational algebra operators only. Our approach performs in two phases. The first phase normalizes the queries producing a canonical form. This form permits to improve the translation into relational algebra performed during the second phase. The improved translation relies on a new operator - the complement-join - that generalizes the set difference, on algebraic expressions of universal quantifiers that avoid the expensive division operator in many cases, and on a special processing of disjunctions by means of constrained outer-joins. Our method achieves an efficiency at least comparable with that of previous proposals, better in most cases. Furthermore, it is considerably simpler to implement as it completely relies on relational data structures and operators.