A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Embedded join dependencies as a tool for decomposing full join dependencies
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
A relational model of data for large shared data banks
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
On the decomposition of join dependencies
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Acyclic Database Schemes (of Various Degrees): A Painless Introduction
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Decompositions of join dependencies in the relational database model
Decompositions of join dependencies in the relational database model
Join processing in relational databases
ACM Computing Surveys (CSUR)
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Decomposition of object-oriented database schemas
Annals of Mathematics and Artificial Intelligence
Strictly chordal graphs are leaf powers
Journal of Discrete Algorithms
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Local consistency for extended CSPs
Theoretical Computer Science
A graph based backtracking algorithm for solving general CSPs
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Relational consistency by constraint filtering
Proceedings of the 2010 ACM Symposium on Applied Computing
Hi-index | 0.00 |
In [10] a method is proposed for decomposing join dependencies (jds) in a relational database using the notion of a hinge. This method was subsequently studied in [11] and [12]. We show how the technique of decomposition can be used to make integrity checking more efficient. It turns out that it is important to find a decomposition that minimizes the number of edges of its largest element. We show that the decompositions obtained with the method described in [10] are optimal in this respect. This minimality criterion leads to the definition of the degree of cyclicity, which allows us to classify jds and leads to the notion of n-cyclicity, of which acyclicity is a special case for n = 2. We then show that, for a fixed value of n (which may be greater than 2). integrity checking can be performed in polynomial time provided we restrict ourselves to n-cyclic jds. Finally, we generalize a well-known characterization for acyclic jds by proving that n-cyclicity is equivalent to “n-wise consistency implies global consistency.” As a consequence, consistency checking can be performed in polynomial time if we restrict ourselves to n-cyclic jds, for a tired value of n, not necessarily equal to 2.