GPU-based computation of distance functions on road networks with applications

Authors:
Marta Fort;J. Antoni Sellarès
Affiliations:
Universitat de Girona, Spain;Universitat de Girona, Spain
Venue:
Proceedings of the 2009 ACM symposium on Applied Computing
Year:
2009

Citing 13
Cited 0

Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Nearest neighbor queries in road networks

GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Fast computation of database operations using graphics processors

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Aggregate Nearest Neighbor Queries in Road Networks

IEEE Transactions on Knowledge and Data Engineering
An efficient and scalable approach to CNN queries in a road network

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases

Geoinformatica
Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases

Proceedings of the 2006 ACM symposium on Applied computing
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A Fast Similarity Join Algorithm Using Graphics Processing Units

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Speed-up techniques for shortest-path computations

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Engineering fast route planning algorithms

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
The islands approach to nearest neighbor querying in spatial networks

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voronoi diagrams and for approximately solving k-Nearest Neighbor queries and Aggregate k-Nearest Neighbor queries on road networks. Finally, we present experimental results obtained with the implementation of our algorithms.