Decomposing a relation into a tree of binary relations
- 31 August 1990
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 41 (1), 2-24
- https://doi.org/10.1016/0022-0000(90)90031-f
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Statistical treatment of the information content of a databaseInformation Systems, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropyIEEE Transactions on Information Theory, 1980
- Multivalued dependencies and a new normal form for relational databasesACM Transactions on Database Systems, 1977
- Consistency in networks of relationsArtificial Intelligence, 1977
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- Approximating discrete probability distributions with dependence treesIEEE Transactions on Information Theory, 1968
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951