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
4707
Venue
SIGMOD
Year
2013
Pagerank
0.00017018712
Overall Rank
764 | 94.69%
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
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,561 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00011358946
1,775 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010602927
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
1,953 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9665955e-05
1,973 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.8913631e-05
2,007 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 9.8081235e-05
2,162 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.3964337e-05
2,801 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.0992955e-05
2,912 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 7.9130459e-05
3,001 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 7.7404487e-05
3,036 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 7.6735171e-05
3,187 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.4136521e-05
3,641 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 6.8884895e-05
3,694 Keys for Graphs 2015 VLDB 6.8345712e-05
3,862 A Partition-Based Approach to Structure Similarity Search 2014 VLDB 6.687769e-05
4,459 Efficient Bi-triangle Counting for Large Bipartite Networks 2021 VLDB 6.1651553e-05
4,470 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 6.1557462e-05
4,494 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 6.1414196e-05
4,556 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0883757e-05
4,836 Making Graphs Compact by Lossless Contraction 2021 SIGMOD 5.8896897e-05
4,968 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 5.7956205e-05
5,009 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 5.761237e-05
5,499 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 5.4750222e-05
5,521 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 5.4614637e-05
5,728 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 5.3507988e-05
5,811 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 5.317401e-05
5,854 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.3006473e-05
5,877 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 5.2916612e-05
5,926 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 5.271318e-05
6,001 GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra 2021 VLDB 5.2415551e-05
6,081 Subgraph Matching over Graph Federation 2022 VLDB 5.2208051e-05
6,281 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.128862e-05
6,289 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 5.1275309e-05
6,395 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.0829204e-05
6,441 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.0603113e-05
6,730 A Hierarchical Contraction Scheme for Querying Big Graphs 2022 SIGMOD 4.9479867e-05
6,971 BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks 2018 SIGMOD 4.8792893e-05
7,100 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 4.8326259e-05
7,307 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 4.7674113e-05
7,641 Extending Graph Patterns with Conditions 2020 SIGMOD 4.6902655e-05
7,762 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 4.6583829e-05
7,934 Fast Local Subgraph Counting 2024 VLDB 4.613363e-05
8,031 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 4.6018906e-05
9,366 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 4.3493859e-05
9,730 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 4.2942813e-05
9,764 View-based Explanations for Graph Neural Networks 2024 SIGMOD 4.2856106e-05
9,788 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 4.2818172e-05
9,862 Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs 2020 VLDB 4.2683554e-05
9,887 Graph Exploration: From Users to Large Graphs 2017 SIGMOD 4.2621158e-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