Database Paper Browser

Back to papers

Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets

Summary: First study of reachability queries in large disk-resident spatiotemporal contact datasets; proposes ReachGrid (on-demand subgraph traversal) and ReachGraph (multi-scale precomputation) to enable efficient evaluation. Disk-aware index placement and experiments show 76% average speedup over existing techniques. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10525
Venue
VLDB
Year
2012
Pagerank
6.5993134e-05
Overall Rank
3,946 | 72.55%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
433 Scalable Network Distance Browsing in Spatial Databases 2008 SIGMOD 0.00023310419
733 GRAIL: Scalable Reachability Index for Large Graphs 2010 VLDB 0.00017460741
2,738 Indexing Large Trajectory Data Sets With SETI* 2003 CIDR 8.2005452e-05
Previous Page 1 / 1 Next

Semantically Similar Papers