Recognizing different types of beta-cycles in a database scheme
From MaRDI portal
(Redirected from Publication:808238)
Recommendations
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Degrees of acyclicity for hypergraphs and relational database schemes
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Cited in
(4)- The existence condition of \(\gamma\)-acyclic database schemes with MVDs constraints.
- scientific article; zbMATH DE number 3881903 (Why is no real title available?)
- Transit functions and pyramid-like binary clustering systems
- A distributed algorithm for recognizing three kinds of acyclic database schemes
This page was built for publication: Recognizing different types of beta-cycles in a database scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808238)