Ranked Enumeration of Minimal Triangulations
Summary: First algorithm to rank-enumerate proper tree decompositions (minimal triangulations) for a broad class of cost functions beyond width/fill-in, yielding many candidate decompositions for specialized or learned objectives. Achieves polynomial-delay under the poly‑MS assumption or constant width; empirically validated on queries, Bayesian networks, and standard benchmarks against prior methods. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Noam Ravid
- 2. Dori Medini
- 3. Benny Kimelfeld
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,360 | Soft and Constrained Hypertree Width | 2025 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 407 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024004562 |
| 626 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018973823 |
| 5,053 | DunceCap: Query Plans Using Generalized Hypertree Decompositions | 2015 | SIGMOD | 5.7323846e-05 |
| 5,323 | Optimizing and Parallelizing Ranked Enumeration | 2011 | VLDB | 5.5693009e-05 |
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,046 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7405307e-05 |
| 7,473 | The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability | 2010 | PODS | 4.7198203e-05 |
| 7,166 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.8124491e-05 |
| 6,997 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8676446e-05 |
| 5,962 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2536266e-05 |
| 8,061 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5943269e-05 |
| 7,293 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7740089e-05 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-05 |