An algorithm for determining minimal reduced-coverings of acyclic database schemes

DOI10.1007/BF02948478zbMath0862.68042OpenAlexW2087210808MaRDI QIDQ2365507

Xinming Ye, Tieying Liu

Publication date: 25 May 1997

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948478

zbMATH Keywords

hypergraphacyclic database schememinimal reduced-covering

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Chordality properties on graphs and minimal conceptual connections in semantic data models
• A distributed algorithm for determining minimal covers of acyclic database schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Syntactic Characterization of Tree Database Schemas
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

This page was built for publication: An algorithm for determining minimal reduced-coverings of acyclic database schemes