Join dependencies in relational-database design

DOI10.1016/0020-0255(89)90007-8zbMath0676.68071OpenAlexW2031274390WikidataQ114685328 ScholiaQ114685328MaRDI QIDQ1123019

O. Yu. Gorchinskaya

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90007-8

zbMATH Keywords

query evaluationrelational database systemsadmissible schemesinference problem for JDlogical scheme designminimum set of database relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Information storage and retrieval of data (68P20)

Related Items (3)

Finite approximatization of languages for representation of system properties: Axiomatization of dependencies ⋮ Relations, dependencies, and some problems of systems theory ⋮ A corrected 5NF definition for relational database design

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of relation schemes and logical design of relational data bases. II
• Theoretical aspects of relational data base design
• Horn clauses and database dependencies

This page was built for publication: Join dependencies in relational-database design