IDAR: Fast Supergraph Search Using DAG Integration
Summary: Introduces DAG integration and four techniques—dynamic programming with the integrated DAG, active-first search, and relevance-size ordering—to accelerate supergraph search (data graphs embedded in a query graph). Experiments report orders-of-magnitude speedups in indexing and query processing versus state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Hyunjoon Kim
- 2. Seunghwan Min
- 3. Kunsoo Park
- 4. Xuemin Lin
- 5. Seok-Hee Hong
- 6. Wook-Shin Han
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,546 | BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification | 2023 | VLDB | 5.9031535e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 267 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00023020464 |
| 487 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017695307 |
| 682 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD | 0.00015144404 |
| 817 | Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins | 2019 | VLDB | 0.0001387659 |
| 1,031 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD | 0.00012615956 |
| 2,302 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8685843e-05 |
| 6,430 | Mining and Indexing Graphs for Supergraph Search | 2013 | VLDB | 5.9436728e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,526 | Updating Graph Indices with a One-Pass Algorithm | 2015 | SIGMOD | 5.9091036e-05 |
| 13,615 | Information Discovery in Loosely Integrated Data | 2007 | SIGMOD | - |
| 3,436 | Performance and Scalability of Indexed Subgraph Query Processing Methods | 2015 | VLDB | 7.482297e-05 |
| 3,403 | Keyword Search on External Memory Data Graphs | 2008 | VLDB | 7.5123237e-05 |
| 10,500 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD | 5.1725247e-05 |
| 434 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018612924 |
| 9,662 | Interactive Graph Search for Multiple Targets on DAGs | 2025 | VLDB | 5.2956801e-05 |
| 6,430 | Mining and Indexing Graphs for Supergraph Search | 2013 | VLDB | 5.9436728e-05 |
| 2,302 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.8685843e-05 |
| 7,628 | DAG Reduction: Fast Answering Reachability Queries | 2017 | SIGMOD | 5.6380029e-05 |