DBScholar

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
he7c7d1e5d473fe05
Venue
SIGMOD
Year
2019
Pagerank
0.00012007739
Overall Rank
1,100 | 92.61%
DOI
10.1145/3299869.3300086

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bhattarai_sigmod19,
        title = {{CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching}},
        author = {Bhattarai, Bibek and Liu, Hang and Huang, H. Howie},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3300086},
        url = {https://dl.acm.org/doi/10.1145/3299869.3300086},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 50 of 53 citing papers.

Rank Citing Paper Year Venue Pagerank
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011622165
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,469 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.412568e-05
3,012 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7512751e-05
3,161 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.5771609e-05
3,165 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5735255e-05
4,077 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8156109e-05
4,124 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7895411e-05
4,512 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5650165e-05
4,589 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5130839e-05
4,783 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4133399e-05
5,383 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1533182e-05
5,426 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1332147e-05
5,556 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.0829894e-05
5,560 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.0822136e-05
5,673 Subgraph Matching over Graph Federation 2022 VLDB 6.0404425e-05
5,880 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9584658e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.9234316e-05
6,235 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8403639e-05
6,506 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.758981e-05
6,517 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7563618e-05
6,966 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6301341e-05
7,483 Extending Graph Patterns with Conditions 2020 SIGMOD 5.5124816e-05
7,535 Fast Local Subgraph Counting 2024 VLDB 5.4983904e-05
7,753 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 5.4575542e-05
8,299 Capturing Associations in Graphs 2020 VLDB 5.3587491e-05
9,038 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2315688e-05
9,157 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.216524e-05
9,368 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1843659e-05
9,576 S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 5.154741e-05
9,657 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.142891e-05
9,804 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1233734e-05
9,919 FusionQuery: On-demand Fusion Queries over Multi-source Heterogeneous Data 2024 VLDB 5.1079647e-05
10,067 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0851868e-05
10,259 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.0480912e-05
10,260 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.0480912e-05
10,264 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.0480912e-05
10,276 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.0461162e-05
10,305 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0392037e-05
10,432 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9769913e-05
10,566 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9769913e-05
10,584 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 4.9769913e-05
10,628 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.9769913e-05
10,651 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9769913e-05
10,744 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9769913e-05
10,750 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9769913e-05
10,756 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9769913e-05
10,798 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9769913e-05
10,998 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9769913e-05
11,062 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9769913e-05
Previous Page 1 / 2 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
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026688651
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
332 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00020756016
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020116134
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018278591
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018190518
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
737 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014357361
1,042 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012331317
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011621825
1,247 SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs 2010 VLDB 0.00011348258
1,507 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010447258
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.0001019315
2,102 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0433983e-05
2,212 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8195478e-05
2,789 iBFS: Concurrent Breadth-First Search on GPUs 2016 SIGMOD 8.0078111e-05
Previous Page 1 / 1 Next

Semantically Similar Papers