Efficient and optimal query answering on independent schemes

DOI10.1016/0304-3975(90)90172-EzbMath0718.68027OpenAlexW2015499128MaRDI QIDQ2639633

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)

Related Items (1)

Independent database schemes under functional and inclusion dependencies

Cites Work

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

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