Database Paper Browser

Back to papers

TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases

Summary: TurboISO delivers ultra-fast, robust subgraph isomorphism for large graphs via on-the-fly candidate region exploration that locates embeddings and stabilizes per-region order. COMB/PERM uses neighborhood equivalence classes (NEC) to enumerate combinations, prune permutations, and deliver speedups on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4708
Venue
SIGMOD
Year
2013
Pagerank
0.00017695307
Overall Rank
487 | 96.62%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 50 of 72 citing papers.

Rank Citing Paper Year Venue Pagerank
682 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015144404
1,031 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012615956
1,097 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012273511
1,278 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011462905
1,336 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011216887
1,469 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010747632
1,566 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010397786
2,094 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2515997e-05
2,162 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 9.0994327e-05
2,163 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.0980747e-05
2,214 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.008953e-05
2,312 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.8466711e-05
2,689 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.317052e-05
2,827 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.1346366e-05
3,209 Keys for Graphs 2015 VLDB 7.7101103e-05
3,396 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5176876e-05
3,479 A Partition-Based Approach to Structure Similarity Search 2014 VLDB 7.4546535e-05
3,749 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.2091565e-05
3,762 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.1990313e-05
3,948 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.0699328e-05
4,018 Efficient Bi-triangle Counting for Large Bipartite Networks 2021 VLDB 7.0241264e-05
4,186 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.9091925e-05
4,693 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6231764e-05
4,702 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.6188333e-05
5,070 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 6.4436438e-05
5,200 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3897796e-05
5,223 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.3799903e-05
5,248 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.3687097e-05
5,261 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.3643865e-05
5,297 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 6.347246e-05
5,353 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 6.3219746e-05
5,511 Subgraph Matching over Graph Federation 2022 VLDB 6.2563094e-05
5,779 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 6.1549096e-05
5,845 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1294746e-05
6,059 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 6.0534485e-05
6,546 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.9031535e-05
6,620 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 5.8801038e-05
6,777 A Hierarchical Contraction Scheme for Querying Big Graphs 2022 SIGMOD 5.8339696e-05
6,819 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.8222444e-05
6,838 GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra 2021 VLDB 5.8190903e-05
7,038 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.7719407e-05
7,235 Extending Graph Patterns with Conditions 2020 SIGMOD 5.7195408e-05
7,460 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 5.6746526e-05
8,117 Fast Local Subgraph Counting 2024 VLDB 5.5419908e-05
9,305 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.3496275e-05
9,717 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2849709e-05
9,757 View-based Explanations for Graph Neural Networks 2024 SIGMOD 5.2759752e-05
9,781 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.2719963e-05
9,859 Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs 2020 VLDB 5.2573864e-05
9,885 Graph Exploration: From Users to Large Graphs 2017 SIGMOD 5.2508963e-05
Previous Page 1 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers