DBScholar

Back to papers

Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized

Summary: Ralph computes fractional and generalized hypertree decompositions via LP randomized approximation. MILP/LP heuristics atop Korchemna et al.'s poly-time fractional approximation enable near-optimal decompositions on HyperBench and solving 500 unsolved instances. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hf12cce1162580622
Venue
SIGMOD
Year
2025
Pagerank
4.9605343e-05
Overall Rank
11,253 | 24.57%
DOI
10.1145/3725296
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{surianarayanan_sigmod25,
        title = {{Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized}},
        author = {Surianarayanan, Vaishali and Mundhra, Anikait and S, Ajaykrishnan E and Lokshtanov, Daniel},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725296},
        url = {https://dl.acm.org/doi/10.1145/3725296},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
318 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021178303
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020048899
467 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017740891
815 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013682594
819 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013623401
1,821 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.5466386e-05
2,316 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 8.6404062e-05
2,593 Secure Yannakakis: Join-Aggregate Queries over Private Data 2021 SIGMOD 8.2282707e-05
3,921 DunceCap: Query Plans Using Generalized Hypertree Decompositions 2015 SIGMOD 6.9059118e-05
4,011 Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins 2023 PODS 6.842581e-05
4,527 Conjunctive Queries with Comparisons 2022 SIGMOD 6.5466033e-05
5,080 Change Propagation Without Joins 2023 VLDB 6.2689958e-05
5,613 HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings 2019 PODS 6.048773e-05
6,557 Ranked Enumeration of Join Queries with Projections 2022 VLDB 5.7298671e-05
7,888 Mind the Gap: Bridging Multi-Domain Query Workloads with EmptyHeaded 2017 VLDB 5.4161029e-05
8,871 Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth 2022 PODS 5.2460913e-05
Previous Page 1 / 1 Next

Semantically Similar Papers