Principles of artificial intelligence
Principles of artificial intelligence
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)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Fast methods for testing quantified relational calculus assertions
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Query optimization for CODASYL database systems
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Access paths in the "Abe" statistical query facility
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Semi-join algorithms for multiprocessor 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
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Types and persistence in database programming languages
ACM Computing Surveys (CSUR)
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
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
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
Adaptive Predicate Managers in Database Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Translating and Optimizing SQL Queries Having Aggregates
VLDB '87 Proceedings of the 13th 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
Data constructors: on the integration of rules and relations
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
| Hi-index | 0.00 |
Database queries explicitly containing existential and universal quantification become increasingly important in a number of areas such as integrity checking, interaction of databases and AI systems, heterogeneous databases, and statistical databases. Using a concept of range nesting in relational calculus expressions, the paper describes evaluation algorithms and transformation methods for an important class of quantified relational calculus queries called perfect expressions. This class includes well-known classes of "easy" queries such as tree queries (with free and existentially quantified variables only), and complacent (disconnected) queries.