• Corpus ID: 8060665

Database Reformulation with Integrity Constraints (extended abstract)

@article{Chirkova2005DatabaseRW,
  title={Database Reformulation with Integrity Constraints (extended abstract)},
  author={Rada Y. Chirkova and Michael R. Genesereth},
  journal={ArXiv},
  year={2005},
  volume={abs/cs/0506026}
}
In this paper we study the problem of reducing the evaluation costs of queries on finite databases in presence of integrity constraints, by designing and materializing views. Given a database schema, a set of queries defined on the schema, a set of integrity constraints, and a storage limit, to find a solution to this problem means to find a set of views that satisfies the storage limit, provides equivalent rewritings of the queries under the constraints (this requirement is weaker than… 

Practical Reformulation of Deductive Databases

This paper presents an improved version of the Bounding Theorem, a reformulation algorithm that runs in exponential time, and shows that the algorithm is correct for all conjunctive queries, i.e. it produces reformulations that are as good as or better than any other reformulation.

A Practical Algorithm for Reformulation of Deductive Databases

This paper presents an improved version of the Bounding Theorem, a reformulation algorithm that runs in exponential time, and shows that the algorithm is correct for all conjunctive queries, i.e. it produces reformulations that are as good as or better than any other reformulation.

Towards Well-Behaved Schema Evolution

This work studies the problem of schema evolution in the RDF data model and asks whether it is possible to characterize the class of RDFS updates which are well-behaved, that is, with a well-dened semantics avoiding ad-hoc solutions.

References

SHOWING 1-10 OF 24 REFERENCES

Generating efficient plans for queries using views

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.

A formal perspective on the view selection problem

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.

Answering queries using views: A survey

  • A. Halevy
  • Computer Science
    The VLDB Journal
  • 2001
The state of the art on the problem of answering queries using views is surveyed, the algorithms proposed to solve it are described, and the disparate works into a coherent framework are synthesized.

Linearly Bounded Reformulations of Conjunctive Databases

This paper focuses on the problem of automatically reformulating a database in a way that reduces query processing time while satisfying strong storage space constraints and concludes that the database reformulation problem is decidable for conjunctive databases.

Designing Views to Efficiently Answer Real SQL Queries

This paper presents results on selecting views to answer queries in relational databases under set, bag, and bag-set semantics, to find sound and complete algorithms for designing views and rewriting queries efficiently.

Testing containment of conjunctive queries under functional and inclusion dependencies

It is shown that the problem of containment (and hence those of equivalence and non-minimality) is in NP when either there are no functional dependencies or the set of dependencies is what the authors call key-based.

Elements of Relational Database Theory

  • P. Kanellakis
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

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.

Efficient optimization of a class of relational expressions

The optimization problem is shown to be NP-complete, but it is shown that a polynomial time algorithm can be given to optimize tableaux that correspond to an important subclass of expressions.