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
11659
Venue
VLDB
Year
2018
Pagerank
7.8061004e-05
Overall Rank
2,963 | 79.41%
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,906 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010135267
2,913 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 7.9229304e-05
3,119 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.5393376e-05
3,488 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 7.0460627e-05
4,554 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0839934e-05
4,756 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 5.9364786e-05
5,002 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 5.7610359e-05
5,502 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 5.4730826e-05
5,809 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 5.3175972e-05
5,921 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 5.2681722e-05
5,968 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.2469955e-05
6,086 Subgraph Matching over Graph Federation 2022 VLDB 5.2157921e-05
7,304 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 4.7628386e-05
7,456 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 4.7205339e-05
7,936 Fast Local Subgraph Counting 2024 VLDB 4.6089395e-05
9,106 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 4.3909979e-05
9,335 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 4.351469e-05
10,014 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 4.1905499e-05
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1905499e-05
10,236 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.1905499e-05
10,270 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.1905499e-05
10,304 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.1905499e-05
10,320 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.1905499e-05
10,523 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.1905499e-05
10,715 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 4.1905499e-05
10,740 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 4.1905499e-05
10,855 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.1905499e-05
10,982 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 4.1905499e-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
389 Counting Triangles in Data Streams 2006 PODS 0.00024649634
503 Worst-case Optimal Join Algorithms 2012 PODS 0.00021517145
1,125 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013829006
1,312 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00012650678
1,487 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00011691164
1,572 Query Preserving Graph Compression 2012 SIGMOD 0.00011296109
1,630 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011073047
2,021 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 9.7730473e-05
2,172 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.37776e-05
2,219 The Input/Output Complexity of Triangle Enumeration 2014 PODS 9.2653868e-05
2,787 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.1219297e-05
2,799 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 8.109137e-05
3,519 Scalable Computation of Acyclic Joins (Extended Abstract) 2006 PODS 7.0181381e-05
4,783 Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration 2015 PODS 5.9215677e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
11,563 Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees 2020 SIGMOD 4.1905499e-05
9,726 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 4.2901665e-05
1,522 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.0001152219
10,740 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 4.1905499e-05
648 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018688754
1,715 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010776518
3,119 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.5393376e-05
1,125 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013829006
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1905499e-05
5,968 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.2469955e-05