Testing unboundedness of database schemes and functional dependencies

DOI10.1016/0020-0190(88)90180-9zbMath0663.68115OpenAlexW2039800360WikidataQ114685338 ScholiaQ114685338MaRDI QIDQ1115211

Héctor J. Hernández, Edward P. F. Chan

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90180-9

zbMATH Keywords

functional dependenciesdatabase schemesweak instances

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

On characterizing boundedness of database schemes with bounded dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent database schemas
• On the desirability of \(\gamma\)-acyclic BCNF database schemes
• Database states and their tableaux
• On the foundations of the universal relation model
• Some Results on the Representative Instance in Relational Databases
• A Proof Procedure for Data Dependencies
• Testing satisfaction of functional dependencies
• Functions in databases
• Equivalences among Relational Expressions
• A characterization of globally consistent databases and their correct access paths

This page was built for publication: Testing unboundedness of database schemes and functional dependencies