A distributed algorithm for determining minimal covers of acyclic database schemes

DOI10.1007/BF02939502zbMATH Open0808.68058OpenAlexW134934973MaRDI QIDQ1333367FDOQ1333367

Authors: 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

Recommendations

• An algorithm for determining minimal reduced-coverings of acyclic database schemes
• A distributed algorithm for recognizing three kinds of acyclic database schemes
• On the existence of acyclic views in a database scheme
• On the Desirability of Acyclic Database Schemes

zbMATH Keywords

distributed algorithmhypergraphminimal coverdistributed environmentacyclic databasesBerge-acyclic databasedepth-first-search tree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• An algorithm for determining minimal reduced-coverings of acyclic database schemes

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

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