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: 5618
Venue: SIGMOD
Year: 2019
Pagerank: 0.00010776518
Overall Rank: 1,715 | 88.09%
DOI: 10.1145/3299869.3300086

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 51 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,009	FusionQuery: On-demand Fusion Queries over Multi-source Heterogeneous Data	2024	VLDB	4.1905499e-05

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
202	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00034881375
351	FG-Index: Towards Verification-Free Query Processing on Graph Databases	2007	SIGMOD	0.00026351742
460	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD	0.00022679846
502	On Graph Query Optimization in Large Networks	2010	VLDB	0.00021528261
616	Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism	2008	VLDB	0.00019068362
648	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018688754
749	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017193776
895	Graph Indexing: Tree + Delta >= Graph	2007	VLDB	0.00015498104
1,125	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00013829006
1,444	SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs	2010	VLDB	0.00011941836
1,487	Parallel Subgraph Listing in a Large-Scale Graph	2014	SIGMOD	0.00011691164
1,630	An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases	2013	VLDB	0.00011073047
2,021	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	9.7730473e-05
2,172	Scalable Subgraph Enumeration in MapReduce	2015	VLDB	9.37776e-05
2,799	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	8.109137e-05
2,882	TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data	2018	SIGMOD	7.9666138e-05
3,235	iBFS: Concurrent Breadth-First Search on GPUs	2016	SIGMOD	7.3298263e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,756	Efficient GPU-Accelerated Subgraph Matching	2023	SIGMOD	5.9364786e-05
2,963	Subgraph Matching: on Compression and Computation	2018	VLDB	7.8061004e-05
9,845	Path-centric Cardinality Estimation for Subgraph Matching	2025	VLDB	4.2680295e-05
10,264	CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination	2026	VLDB	4.1905499e-05
1,125	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00013829006
3,119	Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching	2021	SIGMOD	7.5393376e-05
7,091	BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification	2023	VLDB	4.8304411e-05
648	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018688754
1,906	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00010135267
5,968	A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction	2024	SIGMOD	5.2469955e-05