Database Paper Browser

Back to papers

Processing Proximity Relations in Road Networks

Summary: Defines three proximity relations to model queries on moving objects in road networks. Introduces a moving-object index and road-network partitioning that confines computation to a partial road network, yielding >95% overhead reduction and ~20× speedup vs baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4248
Venue
SIGMOD
Year
2010
Pagerank
4.4153655e-05
Overall Rank
8,986 | 37.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,952 Efficient Algorithms for Finding Optimal Meeting Point on Road Networks 2011 VLDB 4.423107e-05
9,953 Distributed Stream KNN Join 2021 SIGMOD 4.2405999e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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