Database Paper Browser

Back to papers

Fast and Practical Indexing and Querying of Very Large Graphs

Summary: GRIPP: Graph indexing by pre/postorder numbering for fast reachability in large graphs. Linear time and space; sub-5 ms reachability on 5M-node graphs; RDBMS stored procedure, evaluated vs prior schemes on real and synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3906
Venue
SIGMOD
Year
2007
Pagerank
0.00027077424
Overall Rank
334 | 97.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 31 of 31 citing papers.

Rank Citing Paper Year Venue Pagerank
280 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00029092277
377 TEDI: Efficient Shortest Path Query Answering on Graphs 2010 SIGMOD 0.00025074538
460 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022679846
502 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021528261
727 GRAIL: Scalable Reachability Index for Large Graphs 2010 VLDB 0.00017462279
784 Efficiently Answering Reachability Queries on Very Large Directed Graphs 2008 SIGMOD 0.00016648392
916 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00015326675
949 Comparing Stars: On Approximating Graph Edit Distance 2009 VLDB 0.0001510288
1,776 Reachability Queries on Large Dynamic Graphs: A Total Order Approach 2014 SIGMOD 0.0001058029
1,879 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 2013 SIGMOD 0.00010227906
2,118 Efficient SimRank-based Similarity Join Over Large Graphs 2013 VLDB 9.5036922e-05
2,762 K-Reach: Who is in Your Small World 2012 VLDB 8.1614818e-05
3,130 SCARAB: Scaling Reachability Computation on Large Graphs 2012 SIGMOD 7.5054361e-05
3,279 The Case for RodentStore, an Adaptive, Declarative Storage System 2009 CIDR 7.2816693e-05
3,676 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 6.8500097e-05
4,478 Reachability Querying: An Independent Permutation Labeling Approach 2014 VLDB 6.1452192e-05
5,221 Relational Approach for Shortest Path Discovery over Large Graphs 2012 VLDB 5.6180753e-05
5,488 Microblog Entity Linking with Social Temporal Context 2015 SIGMOD 5.4798261e-05
5,548 Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs 2021 VLDB 5.4445937e-05
5,816 An Optimal Labeling Scheme for Workflow Provenance Using Skeleton Labels 2010 SIGMOD 5.3158435e-05
6,223 Cloud-based RDF Data Management 2014 SIGMOD 5.1439129e-05
6,968 ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks 2016 SIGMOD 4.8752859e-05
7,595 DAG Reduction: Fast Answering Reachability Queries 2017 SIGMOD 4.6980168e-05
7,714 Minimum Strongly Connected Subgraph Collection in Dynamic Graphs 2024 VLDB 4.6651585e-05
7,800 Triangular Stability Maximization by Influence Spread over Social Networks 2023 VLDB 4.6437574e-05
7,863 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 4.628688e-05
8,667 Distributed Set Reachability 2016 SIGMOD 4.467539e-05
8,723 GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases 2010 SIGMOD 4.4546285e-05
9,042 HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs 2023 SIGMOD 4.3997447e-05
9,074 Continuously Monitoring Alternative Shortest Paths on Road Networks 2020 VLDB 4.3965098e-05
11,193 Parallel Strong Connectivity Based on Faster Reachability 2023 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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