A characterization of globally consistent databases and their correct access paths

DOI10.1145/319983.319988MaRDI QIDQ4747565zbMATH OpenOpenAlexFDO

Authors Yehoshua Sagiv

Publication date 1983

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027/uiuo.ark:/13960/t7vm5tt5p

zbMATH Keywords

relational algebrafunctional dependencychaserelational databasenull valueuniversal relation schemerepresentative instanceextension join

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited in

(13)

• Independent database schemes under functional and inclusion dependencies
• A characterization of finite fd-acyclicity
• On the desirability of \(\gamma\)-acyclic BCNF database schemes
• Testing unboundedness of database schemes and functional dependencies
• On characterizing boundedness of database schemes with bounded dependencies
• A domain theoretic characterisation of the universal relation
• Connection-trap-free database schemes
• A new interpretation for null values in the weak instance model
• The nested universal relation data model
• Querying Weak Instances Under Extension Chase Semantics: A Complete Solution
• A formal framework for independence with respect to transactions in the universal relation model
• Independent database schemas
• Efficient and optimal query answering on independent schemes

This page was built for publication: A characterization of globally consistent databases and their correct access paths

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