A characterization of finite fd-acyclicity

DOI10.1016/0022-0000(89)90008-1MaRDI QIDQ1264004zbMATH OpenOpenAlexFDO

Authors 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

Database schemesfd- acyclicityfunctional dependenciesrepresentative instance

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• scientific article; zbMATH DE number 3881903
• Weakly independent database schemes
• On acyclic database decompositions

Cites work

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

Cited in

(1)

• On the Desirability of Acyclic Database Schemes

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

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