Answering queries using views: A survey

@article{Halevy2001AnsweringQU,
  title={Answering queries using views: A survey},
  author={Alon Y. Halevy},
  journal={The VLDB Journal},
  year={2001},
  volume={10},
  pages={270-294}
}
  • A. Halevy
  • Published 1 December 2001
  • Computer Science
  • The VLDB Journal
Abstract. The problem of answering queries using views is to find efficient methods of answering a query using a set of previously defined materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a wide variety of data management problems. In query optimization, finding a rewriting of a query using a set of materialized views can yield a more efficient query execution plan. To support… 
MiniCon: A scalable algorithm for answering queries using views
TLDR
The MiniCon is described, a novel algorithm for finding the maximally-contained rewriting of a conjunctive query using a set of conj unctive views and it is shown that the MiniCon scales up well and significantly outperforms the previous algorithms.
Query answering using views for XML
TLDR
An efficient algorithm to find the maximally-contained rewritings in the absence of database schema is presented and its performance is shown experimentally by extending the algorithm to answer queries in XQuery expression.
What is Query Rewriting?
TLDR
A tight connection between view-based query answering and constraint-satisfaction problems, allows to show that the above characterization of which instances of the problem admit a rewriting that is PTIME is going to be difficult.
Answering XML queries using materialized views revisited
TLDR
An original approach for materializing views is suggested which stores for every view node only the list of XML nodes necessary for computing the answer of the view, and a stack-based algorithm is designed which compactly encodes in polynomial time and space all the homomorphisms from a view to a query.
Answering Queries Using Views
TLDR
This book assembles foundational work on answering queries using views in a self-contained manner, with an effort to choose material that constitutes the backbone of the research.
Survey on methods for query rewriting and query answering using views
TLDR
The most important query processing algorithms proposed in the literature for LAV are surveyed, and the principal GAV data integration systems and the form of query processing they adopt are described.
Theory of answering queries using views
TLDR
The theoretical issues concerning the problem of answering queries using views, which is to find efficient methods of answering a query using a set of previously materialized views over the database, are surveyed.
Algorithms for selecting views and indexes to answer queries
TLDR
The focus of the work is to develop a unified quality-centered view- and index-selection approach, for a range of query, view, and index classes that are typical in practical database systems.
Accessing Data Using Views
TLDR
This paper investigates complexity issues and presents efficient sound and complete algorithms that find minimally containing rewritings (MiCR) and check for the existence of contained re writesings, which is an easier problem than finding an MCR.
Interactive Query Formulation for Systems that Rewrite Queries Using Views
TLDR
The CLIDE interactive system is described, which extends the QBE-like query builder of Microsoft’s SQL Server with a coloring scheme that guides the user toward formulating feasible queries and formalizes the behavior of the system using an interaction graph.
...
...

References

SHOWING 1-10 OF 172 REFERENCES
MiniCon: A scalable algorithm for answering queries using views
TLDR
The MiniCon is described, a novel algorithm for finding the maximally-contained rewriting of a conjunctive query using a set of conj unctive views and it is shown that the MiniCon scales up well and significantly outperforms the previous algorithms.
Answering regular path queries using views
TLDR
This work is the first to exhibit decidability in cases where the language for expressing the query and the views allows for recursion, and characterize data, expression, and combined complexity of the problem, showing that the proposed algorithms are essentially optimal.
Answering queries using views (extended abstract)
TLDR
It is shown that all the possible rewritings can be obtained by considering cent ainment mappings from the views to the query, and that the problems considered are NP-complete when both the query and the views are conjunctive and don’t involve builtin comparison predicates.
Answering queries using limited external query processors (extended abstract)
TLDR
It is shown that an infinite set of views can be partitioned into a finite number of equivalence classes, such that picking one view from every nonempty class is sufficient to determine whether the query can be answered using the views.
Answering Queries Using Views in Description Logics
TLDR
This paper addresses the problem of query answering using views for nonrecursive datalog queries embedded in a Description Logics (equipped with nary relations) knowledge base and presents the following results.
A formal perspective on the view selection problem
TLDR
This work considers the problem for views and workloads that consist of equality-selection, project and join queries, and shows that the complexity of the problem depends crucially on the quality of the estimates that a query optimizer has on the size of the views it is considering to materialize.
Generating efficient plans for queries using views
TLDR
The closed-world assumption, in which views are materialized from base relations, rather than views describing sources in terms of abstract predicates, is used, and it is shown that, by careful variable renaming, it is possible to do better than the standard “supplementary relation” approach by dropping attributes that the latter approach would retain.
View-based query processing for regular path queries with inverse
TLDR
This paper addresses the problem of view-based query processing in the context of semistructured data, in particular for the case of regular-path queries extended with the inverse operator, and presents a novel technique based on the use of two-way finite-state automata.
Answering recursive queries using views
TLDR
It is proved that a datalog program P can be effectively rewritten into a program that only uses views, that is contained in P, and that contains all programs that only use views and arecontained in P.
Answering Queries Using Materialized Views with Disjunctions
TLDR
The problem of answering datalog queries using materialized views, where queries are rewritten to refer to views instead of the base relations over which the queries were originally written, is considered.
...
...