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.00012062682
Overall Rank
1,090 | 92.70%
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 54 citing papers.

Rank Citing Paper Year Venue Pagerank
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,988 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2301018e-05
2,480 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.387452e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
3,105 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.6278115e-05
3,107 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6265309e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,133 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7738028e-05
4,370 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6213567e-05
4,485 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5644966e-05
4,801 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.3940913e-05
5,271 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1891764e-05
5,404 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.132986e-05
5,571 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.0628752e-05
5,576 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.062102e-05
5,676 Subgraph Matching over Graph Federation 2022 VLDB 6.0246247e-05
5,895 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9387634e-05
5,995 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.903845e-05
6,245 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8210521e-05
6,251 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8179719e-05
6,272 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.8112899e-05
6,711 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6854796e-05
7,502 Extending Graph Patterns with Conditions 2020 SIGMOD 5.4943054e-05
7,552 Fast Local Subgraph Counting 2024 VLDB 5.4802093e-05
7,752 RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs 2021 VLDB 5.4440674e-05
8,313 Capturing Associations in Graphs 2020 VLDB 5.3410298e-05
8,899 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2401722e-05
9,059 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.21427e-05
9,179 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.1992749e-05
9,601 S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 5.1376962e-05
9,684 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.1258854e-05
9,837 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1064323e-05
9,881 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.1043481e-05
9,882 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.1043481e-05
9,954 FusionQuery: On-demand Fusion Queries over Multi-source Heterogeneous Data 2024 VLDB 5.0910746e-05
10,101 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.068372e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,303 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.0294306e-05
10,333 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0225409e-05
10,379 Algebraic Subgraph Counting 2027 SIGMOD 4.9605343e-05
10,498 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9605343e-05
10,630 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9605343e-05
10,647 GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries 2026 SIGMOD 4.9605343e-05
10,689 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.9605343e-05
10,712 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9605343e-05
10,805 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9605343e-05
10,811 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9605343e-05
10,817 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9605343e-05
10,859 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9605343e-05
11,059 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9605343e-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.00026634326
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
333 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00020712452
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
440 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018235529
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
734 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014334121
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012315969
1,180 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011600363
1,252 SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs 2010 VLDB 0.00011321716
1,502 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010431532
1,565 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010185615
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0309825e-05
2,226 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.7971869e-05
2,797 iBFS: Concurrent Breadth-First Search on GPUs 2016 SIGMOD 7.9831781e-05
Previous Page 1 / 1 Next

Semantically Similar Papers