Answering queries using templates with binding patterns (extended abstract)

@article{Rajaraman1995AnsweringQU,
  title={Answering queries using templates with binding patterns (extended abstract)},
  author={Anand Rajaraman and Yehoshua Sagiv and Jeffrey D. Ullman},
  journal={Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems},
  year={1995},
  url={https://api.semanticscholar.org/CorpusID:209399936}
}
This work shows how to decide with a nondeterministic polynomial-time algorithm whether the given query can be answered and extends the results to allow arithmetic comparisons in the givenquery and in the templates.
View on ACM
citeseerx.ist.psu.edu
327 Citations
Highly Influential Citations
17
Background Citations
120
Methods Citations
32
Results Citations
1

Figures from this paper

327 Citations

Computing Complete Answers to Queries with Binding Restrictions (extended Version)

    Chen Li
    Computer Science
  • 1999
A decision tree is developed that guides the query planning process to compute the complete answer to a conjunctive query, if it can be computed at all, and it is proved that if a set of rules and a query goal have a feasible rule/goal graph, then the query is stable.

Complete Answers to Queries with Binding Restrictions

    Chen Li
    Computer Science
  • 1999
A decision tree is developed that guides the query planning process to compute the complete answer to a conjunctive query, if it can be computed at all, and it is proved that if a set of rules and a query goal have a feasible rule/goal graph, then the query is stable.

Answering queries with useful bindings

This article proposes a query-planning framework to answer queries in the presence of limited access patterns, and develops algorithms to solve optimization problems in this framework, and thus construct an efficient program to answer a query.

Answering queries with arithmetic expressions in heterogeneous systems

This work proposes a model for query answering in this context and introduces a corresponding rewriting algorithm that uses views to provide answers and develops a prototype of this model in Java and describes its design and implementation details.

On Answering Queries in the Presence of Limited Access Patterns

This paper considers the following fundamental problem: can the authors compute the complete answer to a query by accessing the relations with legal patterns, and gives algorithms for solving the problem for various classes of queries, including conjunctive queries, unions of conjunction queries, and conj unctive queries with arithmetic comparisons.

Answering queries using views with arithmetic comparisons

A novel algorithm is developed to obtain maximally-contained rewritings (MCRs) for queries having left (or right) semi-interval-comparison predicates, and it is shown that it is decidable to obtain equivalent rewriting for CQAC queries.

Query folding

    Xiaolei Qian
    Computer Science
    Proceedings of the Twelfth International…
  • 1996
An exponential time algorithm that finds all complete or partial foldings, and a polynomial time algorithm for the subclass of acyclic conjunctive queries for the purpose of query answering in federated databases are developed.

Processing first-order queries under limited access patterns

An approximation to feasibility is defined which can be computed in NP for any first-order query and in P for unions of conjunctive queries with negation and a practical overall strategy for processing first- order queries under limited access patterns is outlined.

Computing complete answers to queries in the presence of limited access patterns

This article study the problem of computing the complete answer to a query, i.e., the answer that could be computed if all the tuples could be retrieved, and proposes a decision tree for guiding the process to compute thecomplete answer.

Answering queries using limited external query processors (extended abstract)

This work considers the problem of answering conjunctive queries using infinite sets of conjunctive views, and presents a result of independent interest, namely, an algorithm to minimize such queries.
...

18 References

Optimal implementation of conjunctive queries in relational data bases

It is shown that while answering conjunctive queries is NP complete (general queries are PSPACE complete), one can find an implementation that is within a constant of optimal.

Answering queries using views (extended abstract)

This work considers the problem of finding a rewriting of a query that uses the materialized views, the problem of finding minimal rewritings, and finding complete rewritings (i.e., rewritings that use only the views).

Answering Queries Using Views.

It is shown that all the possible rewritings can be obtained by considering containment mappings from the views to the query, and that the problems the authors consider are NP-complete when both the query and the views are conjunctive and don't involve builtin comparison predicates.

On Efficient Reasoning with Implication Constraints

Criteria for designing a set of implication constraints is given so that an efficient process, called “units-refutation” process can be used to solve the IC-refuting problem.

Query Transformation for PSJ-Queries

This paper has solved the query transformation problem for the case when both the query and the derived relations are defined by P&I-expressions, that is, relational algebra expressions containing only projects, selects and joins.

Queries Independent of Updates

New insight into the independence problem is provided by reducing it to the equivalence problem for datalog programs (both for the case of insertion and deletion updates) and new cases in which independence is decidable are presented.

On conjunctive queries containing inequalities

Algorithms for containment and equivalence of such “inequality queries” are given, under the assumption that the data domains are dense and totally ordered.

Equivalences Among Relational Expressions with the Union and Difference Operators

It is shown that containment of tableaux is a necessary step in testing equivalence of queries with union and difference, and the containment problem is shown to be NP-complete even for tableaux that correspond to expressions with only one project and several join operators.

Equivalence among Relational Expressions with the Union and Difference Operation

It is shown that the theory of tableaux is easily extended to sets of tableau, but the equivalence problem for sets of Tableaux (as well as the containment problem for single tableaux) is NP-complete even in very restricted cases.

Optimizing queries with materialized views

This paper analyzes the optimization question and provides a comprehensive and efficient solution and has the desirable property that it is a simple generalization of the traditional query optimization algorithm.