Efficient and optimal query answering on independent schemes

DOI10.1016/0304-3975(90)90172-EMaRDI QIDQ2639633zbMATH OpenOpenAlexFDO

Authors Paolo Atzeni, Edward P. F. Chan

Publication date 1990

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(90)90172-e

zbMATH Keywords

relational databasesquery answeringindependent schemesunions of simple chase join expansionsUniversal Relation Interfaceweak instance model

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Evaluation of queries in independent database schemes
• Efficient Approximations of Conjunctive Queries
• On the data complexity of consistent query answering
• Efficient query processing with reduced implicate tries
• Towards better separation between deterministic and randomized query complexity
• Efficient top-down computation of queries under the well-founded semantics
• Optimization of quasiconjunctive queries

Cites work

• A characterization of globally consistent databases and their correct access paths
• A relational model of data for large shared data banks
• Equivalence of Relational Database Schemes
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Equivalences among Relational Expressions
• Evaluation of queries in independent database schemes
• Independent and Separable Database Schemes
• Independent database schemas
• On the foundations of the universal relation model
• Some Results on the Representative Instance in Relational Databases
• Testing satisfaction of functional dependencies

Cited in

(3)

• The 1-Versus-2 Queries Problem Revisited
• Independent database schemes under functional and inclusion dependencies
• Evaluation of queries in independent database schemes

This page was built for publication: Efficient and optimal query answering on independent schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639633)