Querying Weak Instances Under Extension Chase Semantics: A Complete Solution

DOI10.1080/0020716031000079509MaRDI QIDQ4707309zbMATH OpenOpenAlexFDO

Authors

Publication date 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716031000079509

zbMATH Keywords

relational databasesincomplete informationdeductive databasesuniversal scheme interfaces

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 4049159
• Preserving constraints with the stable chase
• Strong equivalence of relational expressions under dependencies
• Anatomy of the Chase
• scientific article; zbMATH DE number 35423

Cites work

• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• A Proof Procedure for Data Dependencies
• A characterization of globally consistent databases and their correct access paths
• Construction of relations in relational databases
• Database states and their tableaux
• Evaluation of queries in independent database schemes
• Independence-reducible database schemes
• On the foundations of the universal relation model
• Testing satisfaction of functional dependencies
• The use of deleted tuples in database querying and updating
• Update and retrieval in a relational database through a universal schema interface

This page was built for publication: Querying Weak Instances Under Extension Chase Semantics: A Complete Solution

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