Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
Graphs and Hypergraphs
Elimination of intersection anomalies from database schemes
Journal of the ACM (JACM)
A theory of intersection anomalies in relational database schemes
Journal of the ACM (JACM)
Communications of the ACM
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Maximal objects and the semantics of universal relation databases
ACM Transactions on Database Systems (TODS)
GYO reductions, canonical connections, tree and cyclic schemas and tree projections
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Elimination of intersection amomalies from database schemes
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Algebra for Probabilistic Databases
IEEE Transactions on Knowledge and Data Engineering
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
| Hi-index | 0.02 |
We demonstrate a sense in which the equivalence between blocks (subgraphs without articulation points) and biconnected components (subgraphs in which there are two edge-disjoint paths between any pair of nodes) that holds in ordinary graph theory can be generalized to hypergraphs. The result has an interpretation for relational databases that the universal relations described by acyclic join dependencies are exactly those for which the connections among attributes are defined uniquely. We also exhibit a relationship between the process of Graham reduction [6] of hypergraphs and the process of tableau reduction [1] that holds only for acyclic hypergraphs.