Database Paper Browser

Back to papers

Subgraph Matching: on Compression and Computation

Summary: Addresses the output crisis in subgraph matching by studying compression of the result I and its impact on computation. Proposes VCBC to encode I as code(I) (up to 10^5×) and CBF to compute on code(I), reducing output and intermediate costs; experiments show CBF beating baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11658
Venue
VLDB
Year
2018
Pagerank
7.7559339e-05
Overall Rank
2,997 | 79.16%
DOI
10.14778/3149193.3149198

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 28 of 28 citing papers.

Rank Citing Paper Year Venue Pagerank
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
2,909 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 7.9305767e-05
3,187 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.4136521e-05
3,641 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 6.8884895e-05
4,556 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0883757e-05
4,968 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 5.7956205e-05
5,009 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 5.761237e-05
5,728 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 5.3507988e-05
5,811 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 5.317401e-05
5,926 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 5.271318e-05
6,081 Subgraph Matching over Graph Federation 2022 VLDB 5.2208051e-05
6,281 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.128862e-05
7,307 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 4.7674113e-05
7,934 Fast Local Subgraph Counting 2024 VLDB 4.613363e-05
8,031 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 4.6018906e-05
9,106 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 4.3952103e-05
9,330 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 4.3556432e-05
10,014 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 4.1945683e-05
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
10,236 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.1945683e-05
10,270 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.1945683e-05
10,292 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.1945683e-05
10,308 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.1945683e-05
10,514 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.1945683e-05
10,708 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 4.1945683e-05
10,733 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 4.1945683e-05
10,851 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.1945683e-05
10,979 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Rank Cited Paper Year Venue Pagerank
392 Counting Triangles in Data Streams 2006 PODS 0.00024556183
502 Worst-case Optimal Join Algorithms 2012 PODS 0.00021526612
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,308 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00012661651
1,500 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00011674394
1,579 Query Preserving Graph Compression 2012 SIGMOD 0.00011283792
1,635 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001105793
2,007 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 9.8081235e-05
2,162 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.3964337e-05
2,215 The Input/Output Complexity of Triangle Enumeration 2014 PODS 9.2717602e-05
2,801 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.0992955e-05
2,910 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 7.9266529e-05
3,515 Scalable Computation of Acyclic Joins (Extended Abstract) 2006 PODS 7.0220813e-05
4,779 Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration 2015 PODS 5.9271735e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
11,559 Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees 2020 SIGMOD 4.1945683e-05
9,727 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 4.2942813e-05
1,561 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00011358946
10,733 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 4.1945683e-05
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
1,775 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010602927
3,187 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.4136521e-05
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
6,281 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.128862e-05