Database Paper Browser

Back to papers

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)

Paper ID
5032
Venue
SIGMOD
Year
2015
Pagerank
5.9091036e-05
Overall Rank
6,526 | 54.65%
DOI
10.1145/2723372.2746482

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers