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
5679
Venue
SIGMOD
Year
2019
Pagerank
0.00012166591
Overall Rank
1,102 | 92.45%
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 52 citing papers.

Rank Citing Paper Year Venue Pagerank
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,288 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.8025299e-05
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-05
3,194 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6491858e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,563 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6291459e-05
4,722 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.5438628e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
4,995 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.4089186e-05
5,275 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.2873652e-05
5,415 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.2255551e-05
5,427 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.2230767e-05
5,581 Subgraph Matching over Graph Federation 2022 VLDB 6.1624715e-05
5,758 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 6.0972035e-05
5,870 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 6.061038e-05
5,942 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.0334209e-05
6,149 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.9581422e-05
6,393 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8879832e-05
6,924 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.738697e-05
7,150 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.687428e-05
7,365 Extending Graph Patterns with Conditions 2020 SIGMOD 5.6329929e-05
7,624 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 5.5805027e-05
8,113 Capturing Associations in Graphs 2020 VLDB 5.484341e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
8,871 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.35418e-05
9,383 S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 5.2755515e-05
9,440 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2680376e-05
9,617 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.2434488e-05
9,693 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2351259e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
10,084 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.1573064e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,354 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 5.093636e-05
10,375 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.093636e-05
10,376 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,428 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,452 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,564 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 5.093636e-05
10,590 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 5.093636e-05
10,606 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 5.093636e-05
10,787 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 5.093636e-05
10,885 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
11,165 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.093636e-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
177 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00027100548
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
326 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00021152829
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
727 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014565738
1,036 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012499878
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,231 SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs 2010 VLDB 0.00011571594
1,487 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010615297
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
2,119 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.141144e-05
2,182 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 9.010121e-05
2,874 iBFS: Concurrent Breadth-First Search on GPUs 2016 SIGMOD 8.0094569e-05
Previous Page 1 / 1 Next

Semantically Similar Papers