A distributed algorithm for determining minimal covers of acyclic database schemes

DOI10.1007/BF02939502zbMath0808.68058OpenAlexW134934973MaRDI QIDQ1333367

Xinming Ye

Publication date: 13 September 1994

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

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

zbMATH Keywords

hypergraphdistributed algorithmminimal coverdistributed environmentacyclic databasesBerge-acyclic databasedepth-first-search tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Distributed algorithms (68W15)

Related Items (1)

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

Cites Work

• Chordality properties on graphs and minimal conceptual connections in semantic data models
• On the existence of acyclic views in a database scheme
• On the Desirability of Acyclic Database Schemes

This page was built for publication: A distributed algorithm for determining minimal covers of acyclic database schemes