Decomposing a relation into a tree of binary relations

Arnborg, 1985, Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey, BIT, 25, 2, 10.1007/BF01934985 Beeri, 1983, On the desirability of acyclic database schemes, J. Assoc. Comput. Mach., 30, 479, 10.1145/2402.322389 Chow, 1968, Approximating discrete probability distributions with dependence trees, IEEE Trans. Inform. Theory, 462, 10.1109/TIT.1968.1054142 Dechter, 1987, Network-based heuristics for constraint-satisfaction problems, Artif. Intell. J., 34, 1, 10.1016/0004-3702(87)90002-6 Even, 1979 Fagin, 1977, Multivalued dependencies and a new form for relational databases, ACM Trans. Database Systems, 2, 262, 10.1145/320557.320571 Kruskal, 1956, On the shortest spanning subtrec of a graph and the traveling salesman problem, 7, 48 Kullback, 1951, Information and sufficiency, Ann. Math. Statist., 22, 79, 10.1214/aoms/1177729694 Lawler, 1976 Mackworth, 1977, Consistency in networks of relations, Artif. Intell., 8, 99, 10.1016/0004-3702(77)90007-8 Maier, 1983 Malvestuto, 1986, Decomposing complex contingency tables to reduce storage requirements Malvestuto, 1986 Malvestuto, 1986, Statistical treatment of the information content of a database, Inform. Systems, 11, 211, 10.1016/0306-4379(86)90029-3 Malvestuto, 1987, Answering queries in categorical databases, 87 Montanari, 1974, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci., 7, 95, 10.1016/0020-0255(74)90008-5 Pearl, 1986, On the logic of representing dependencies by graphs Pearl, 1988 Shore, 1980, Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy, IEEE Trans. Inform. Theory, IT-26, 26, 10.1109/TIT.1980.1056144