A characterization of finite fd-acyclicity

DOI10.1016/0022-0000(89)90008-1zbMath0688.68091OpenAlexW1987266256MaRDI QIDQ1264004

Yehoshua Sagiv, Oded Shmueli

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90008-1

zbMATH Keywords

functional dependenciesDatabase schemesfd- acyclicityrepresentative instance

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Acyclic join dependency and data base projections
• Inclusion dependencies and their interaction with functional dependencies
• On the Desirability of Acyclic Database Schemes
• Syntactic Characterization of Tree Database Schemas
• An extension of conflict-free multivalued dependency sets
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• On Determining Tree Query Membership Of A Distributed Query
• An integrated approach to logical design of relational database schemes
• Using Semi-Joins to Solve Relational Queries
• Testing satisfaction of functional dependencies
• A simplied universal relation assumption and its properties
• Tree queries
• Equivalences among Relational Expressions
• A characterization of globally consistent databases and their correct access paths

This page was built for publication: A characterization of finite fd-acyclicity