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.9793485e-05
Overall Rank
10,788 | 27.47%
DOI
10.14778/3819518.3819552

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.00024884544
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
818 Hypertree Decompositions: Questions and Answers 2016 PODS 0.0001366708
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012977594
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,027 GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph 2014 VLDB 0.00012422544
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,119 Query Optimization by Predicate Move-Around 1994 VLDB 0.00011950395
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0476814e-05
2,166 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9334874e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4178183e-05
2,469 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.4165523e-05
3,164 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5771124e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
4,123 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7927568e-05
4,509 Conjunctive Queries with Comparisons 2022 SIGMOD 6.570408e-05
4,511 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5681258e-05
5,396 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1494643e-05
5,422 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1361195e-05
5,450 Accurate and Fast Approximate Graph Pattern Mining at Scale 2025 VLDB 6.1247776e-05
6,515 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7590881e-05
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
10,253 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.050482e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,258 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.050482e-05
10,264 EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) 1984 SIGMOD 5.050482e-05
11,656 A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition 2024 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Semantically Similar Papers