Abstract
Much research has recently been devoted to the data management foundations of location-based mobile services. In one important scenario, the service users are constrained to a transportation network. As a result, query processing
in spatial road networks is of interest. We propose a versatile approach to k nearest neighbor computation in spatial networks, termed the Islands approach.
By offering flexible yet simple means of balancing re-computation and pre-computation, this approach is able to manage the trade-off between query and update performance. The result is a single, efficient, and versatile approach to k nearest neighbor computation that obviates the need for using several k nearest neighbor approaches for supporting a single service scenario. The experimental comparison with the existing techniques uses real-world road network data and
considers both I/O and CPU performance, for both queries and updates.
Original language | English |
---|---|
Title of host publication | Advances in Spatial and Temporal Databases : Proceedings of 9th International Symposium, SSTD 2005, Angra dos Reis, Brazil, August 22-24, 2005 |
Editors | Claudia Bauzer Medeiros, Max Egenhofer, Elisa Bertino |
Number of pages | 18 |
Publisher | IEEE Computer Society Press |
Publication date | 2005 |
Edition | 3633 |
Pages | 73-90 |
ISBN (Electronic) | 3540281274 |
DOIs | |
Publication status | Published - 2005 |
Event | International Symposium on Spatial and Temporal Databases - Angra dos Reis, Brazil Duration: 22 Aug 2005 → 24 Aug 2005 Conference number: 9th |
Conference
Conference | International Symposium on Spatial and Temporal Databases |
---|---|
Number | 9th |
Country/Territory | Brazil |
City | Angra dos Reis |
Period | 22/08/2005 → 24/08/2005 |
Series | Lecture Notes in Computer Science |
---|---|
Number | 3633 |