Efficient approximations of conjunctive queries
Year: 2012
Type: conference-paper
Abstract: When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such approximations for conjunctive queries. These queries are of special importance in databases, and we have a very good understanding of the classes that admit fast query evaluation, such as acyclic, or bounded (hyper)treewidth queries.
Authors: Pablo Barceló, Leonid Libkin, Miguel Romero
Institutions: University of Chile, University of Edinburgh
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2017888407
