Decomposing a relation into a tree of binary relations

DOI10.1016/0022-0000(90)90031-FzbMath0694.68019MaRDI QIDQ909447

Rina Dechter

Publication date: 1990

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

algorithmtree decompositiondatabase schemetree of binary relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (9)

Decomposability of partially defined Boolean functions ⋮ Uncovering trees in constraint networks ⋮ Fuzzy functional dependencies and Bayesian networks ⋮ Implicit representation of relations ⋮ Unifying tree decompositions for reasoning in graphical models ⋮ Approximate inference of functional dependencies from relations ⋮ Structure identification in relational data ⋮ Conjunctive-query containment and constraint satisfaction ⋮ Decomposing constraint satisfaction problems using database techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• Statistical treatment of the information content of a database
• Networks of constraints: Fundamental properties and applications to picture processing
• On the Desirability of Acyclic Database Schemes
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Approximating discrete probability distributions with dependence trees
• On Information and Sufficiency

This page was built for publication: Decomposing a relation into a tree of binary relations