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 4 of 54 citing papers.

Previous Page 2 / 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