Decomposing an N-ary relation into a tree of binary relations

Authors:
R. Dechter
Affiliations:
Artificial Intelligence Center, Hughes Aircraft Company, Calabasas, CA and Cognitive Systems Laboratory, Computer Science Department, University of California, Los Angeles, CA
Venue:
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1987

Citing 2
Cited 3

A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Theory of Relational Databases

Theory of Relational Databases

Normal forms and syntactic completeness proofs for functional independencies

Theoretical Computer Science
Dependency Inference

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Tree decomposition with applications to constraint processing

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient algorithm for decomposing an n-ary relation into a tree of binary relations, and provide an efficient test for checking whether or not the tree formed represents the relation. If there exists a tree-decomposition, the algorithm is guaranteed to find one, otherwise, the tree generated will fail the test, then indicating that no tree decomposition exist. The unique features of the algorithm presented in this paper, is that it does not apriori assume any dependencies in the initial relation, rather it derives such dependencies from the bare relation instance.