Database Paper Browser

Back to papers

CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching

Summary: CECI: Compact Embedding Cluster Index for scalable subgraph matching; partitions graph into embedding clusters. BFS pruning with rev-BFS refinement prune candidates; set-intersection replaces edge checks; cost-estimation guides clustering; 20.4x faster listing embeddings, 2.6x for 1,024. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5617
Venue
SIGMOD
Year
2019
Pagerank
0.00010602927
Overall Rank
1,775 | 87.66%
DOI
10.1145/3299869.3300086

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 50 of 50 citing papers.

Rank Citing Paper Year Venue Pagerank
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
3,009 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 7.7214924e-05
3,036 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 7.6735171e-05
3,778 A Learned Sketch for Subgraph Counting 2021 SIGMOD 6.7747398e-05
4,470 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 6.1557462e-05
4,836 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 5.8896897e-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,499 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 5.4750222e-05
5,728 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 5.3507988e-05
5,773 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 5.3319911e-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
6,289 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 5.1275309e-05
6,395 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.0829204e-05
6,441 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.0603113e-05
6,575 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 5.0052259e-05
7,100 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 4.8326259e-05
7,307 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 4.7674113e-05
7,641 Extending Graph Patterns with Conditions 2020 SIGMOD 4.6902655e-05
7,804 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 4.6466513e-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
8,211 Capturing Associations in Graphs 2020 VLDB 4.5581054e-05
9,366 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 4.3493859e-05
9,727 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 4.2942813e-05
9,730 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 4.2942813e-05
9,934 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 4.2496728e-05
9,935 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 4.2482599e-05
10,014 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 4.1945683e-05
10,062 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.1945683e-05
10,084 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 4.1945683e-05
10,085 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 4.1945683e-05
10,096 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 4.1945683e-05
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
10,139 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
10,163 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.1945683e-05
10,264 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 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,632 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.1945683e-05
10,696 S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 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,948 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 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
11,006 FusionQuery: On-demand Fusion Queries over Multi-source Heterogeneous Data 2024 VLDB 4.1945683e-05
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
203 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00034889335
350 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00026365067
461 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022499343
506 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021475362
612 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.0001920234
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
764 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017018712
900 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00015495155
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,454 SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs 2010 VLDB 0.00011913289
1,500 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00011674394
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,910 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 7.9266529e-05
2,912 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 7.9130459e-05
3,233 iBFS: Concurrent Breadth-First Search on GPUs 2016 SIGMOD 7.3361904e-05
Previous Page 1 / 1 Next

Semantically Similar Papers