CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
Multiple Range Query Optimization in Spatial Databases
ADBIS '98 Proceedings of the Second East European Symposium on Advances in Databases and Information Systems
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Computational data modeling for network-constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
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
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
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
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
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
A web-enabled extension of a spatio-temporal DBMS
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Monitoring Aggregate k-NN Objects in Road Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Continuous proximity monitoring in road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
High-dimensional kNN joins with incremental updates
Geoinformatica
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Coupling or decoupling for KNN search on road networks?: a hybrid framework on user query patterns
Proceedings of the 20th ACM international conference on Information and knowledge management
Spatial-temporal query homogeneity for KNN object search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
On the efficiency of multiple range query processing in multidimensional data structures
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries for points of interest that are accessible via the road network. Given multiple k nearest neighbor queries, the paper proposes progressive techniques that selectively cache query results in main memory and subsequently reuse these for query processing. The paper initially proposes techniques for the case where an upper bound on k is known a priori and then extends the techniques to the case where this is not so. Based on empirical studies with real-world data, the paper offers insight into the circumstances under which the different proposed techniques can be used with advantage for multiple k nearest neighbor query processing.