A distributed algorithm for determining minimal covers of acyclic database schemes

DOI10.1007/BF02939502MaRDI QIDQ1333367zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 4057065 (Why is no real title available?)
• An algorithm for determining minimal reduced-coverings of acyclic database schemes
• A distributed algorithm for recognizing three kinds 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)