DBScholar

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
4310
Venue
SIGMOD
Year
2010
Pagerank
5.3153925e-05
Overall Rank
9,143 | 37.28%
DOI
10.1145/1807167.1807196

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{xu_sigmod10,
        title = {{Processing Proximity Relations in Road Networks}},
        author = {Xu, Zhengdao and Jacobsen, Hans-Arno},
        series = {{SIGMOD} '10},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1807167.1807196},
        url = {https://dl.acm.org/doi/10.1145/1807167.1807196},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
9,111 Efficient Algorithms for Finding Optimal Meeting Point on Road Networks 2011 VLDB 5.3221578e-05
10,102 Distributed Stream KNN Join 2021 SIGMOD 5.1488731e-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