Recognizing different types of beta-cycles in a database scheme
From MaRDI portal
Publication:808238
DOI10.1016/0304-3975(91)90197-AzbMath0731.68030OpenAlexW2059012016MaRDI QIDQ808238
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90197-a
Related Items
Cites Work
- Unnamed Item
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs