DBScholar

Back to papers

Subgraph Enumeration: Beyond Tree Decomposition

Summary: MDSE advances unlabeled subgraph enumeration beyond tree decompositions with minimal fractional hypertree decompositions, complete symmetry breaking, and MixJoin’s low-materialization result assembly. An enhanced cost model guides attribute orders across intersection and materialization costs. (summarized by gpt-5.6-luna on Aug 17 2026)

Paper ID
h291ee8a3bbc1c01c
Venue
VLDB
Year
2026
Pagerank
4.9605343e-05
Overall Rank
10,859 | 27.22%
DOI
10.14778/3819518.3819552
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{li_vldb26,
        title = {{Subgraph Enumeration: Beyond Tree Decomposition}},
        author = {Li, Qiyan and Yu, Jeffrey Xu and He, Zongyan},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {9},
        pages = {2303--2316},
        doi = {10.14778/3819518.3819552},
        url = {https://doi.org/10.14778/3819518.3819552},
        year = {2026}
}

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 38 of 38 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
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
440 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018235529
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
819 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013623401
942 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012936571
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,031 GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph 2014 VLDB 0.00012379698
1,090 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012062682
1,122 Query Optimization by Predicate Move-Around 1994 VLDB 0.00011915958
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,907 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.379165e-05
1,988 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2301018e-05
2,023 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1568397e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0309825e-05
2,128 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9879343e-05
2,478 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3890338e-05
2,480 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.387452e-05
3,107 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6265309e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,133 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7738028e-05
4,370 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6213567e-05
4,527 Conjunctive Queries with Comparisons 2022 SIGMOD 6.5466033e-05
5,271 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1891764e-05
5,418 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1264302e-05
5,471 Accurate and Fast Approximate Graph Pattern Mining at Scale 2025 VLDB 6.1016355e-05
6,272 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.8112899e-05
6,711 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6854796e-05
7,552 Fast Local Subgraph Counting 2024 VLDB 5.4802093e-05
8,899 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2401722e-05
9,881 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.1043481e-05
9,882 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.1043481e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,297 EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) 1984 SIGMOD 5.031399e-05
11,708 A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition 2024 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers