Query folding
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 48-55
- https://doi.org/10.1109/icde.1996.492088
Abstract
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previous queries, or queries answerable by other databases. We investigate query folding in the context where queries and resources are conjunctive queries. We develop an exponential time algorithm that finds all complete or partial foldings, and a polynomial time algorithm for the subclass of acyclic conjunctive queries. Our results can be applied to query optimization in centralized databases, to query processing in distributed databases, and to query answering in federated databases.Keywords
This publication has 9 references indexed in Scilit:
- A predicate-based caching scheme for client-server database architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimizing queries with materialized viewsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Data model and query evaluation in global information systemsJournal of Intelligent Information Systems, 1995
- The logic of constraint satisfactionArtificial Intelligence, 1992
- Optimizing Conjunctive Queries that Contain Untyped VariablesSIAM Journal on Computing, 1983
- Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM, 1980
- Efficient optimization of a class of relational expressionsACM Transactions on Database Systems, 1979
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977