Updating Graph Indices with a One-Pass Algorithm
Summary: One-pass algorithm to update graph indices by scanning each frequent subgraph at most once, using branch-and-bound pruning. Decomposed index uses O(|G|+|Q|) space; yields 5–100x faster updates and 1–2x faster queries than FGindex/gIndex, with near-optimal guarantees. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dayu Yuan (Google; Pennsylvania State University)
- 2. Prasenjit Mitra (Pennsylvania State University; Qatar Computing Research Institute)
- 3. Huiwen Yu (Pennsylvania State University)
- 4. C. Lee Giles (Pennsylvania State University)
BibTeX Citation
@inproceedings{yuan_sigmod15,
title = {{Updating Graph Indices with a One-Pass Algorithm}},
author = {Yuan, Dayu and Mitra, Prasenjit and Yu, Huiwen and Giles, C. Lee},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2746482},
url = {https://dl.acm.org/doi/10.1145/2723372.2746482},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 6.2436385e-05 |
| 7,848 | Data-driven Visual Graph Query Interface Construction and Maintenance: Challenges and Opportunities | 2016 | VLDB | 5.5327238e-05 |
| 9,131 | TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database | 2023 | SIGMOD | 5.3184767e-05 |
| 11,671 | MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces | 2021 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00027100548 |
| 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00021152829 |
| 431 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018577017 |
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
| 2,328 | Towards Graph Containment Search and Indexing | 2007 | VLDB | 8.745748e-05 |
| 3,431 | iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques | 2010 | VLDB | 7.4189541e-05 |
| 6,641 | GAIA: Graph Classification Using Evolutionary Computation | 2010 | SIGMOD | 5.8162256e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD |
| 2 | 6,520 | Mining and Indexing Graphs for Supergraph Search | 2013 | VLDB |
| 3 | 727 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB |
| 4 | 2,328 | Towards Graph Containment Search and Indexing | 2007 | VLDB |
| 5 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 6 | 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB |
| 7 | 3,421 | Updates for Structure Indexes | 2002 | VLDB |
| 8 | 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD |
| 9 | 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |
| 10 | 3,477 | Performance and Scalability of Indexed Subgraph Query Processing Methods | 2015 | VLDB |