Conference Proceeding Article
Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly dynamic scenarios, where the queries and the data objects move frequently and arbitrarily. All existing methods, however, assume the Euclidean distance metric. In this paper we study k-NN monitoring in road networks, where the distance between a query and a data object is determined by the length of the shortest path connecting them. We propose two methods that can handle arbitrary object and query moving patterns, as well as °uctuations of edge weights. The ¯rst one maintains the query results by processing only updates that may invalidate the current NN sets. The second method follows the shared execution paradigm to reduce the processing time. In particular, it groups together the queries that fall in the path between two consecutive intersections in the network, and produces their results by monitoring the NN sets of these intersections. We experimentally verify the applicability of the proposed techniques to continuous monitoring of large data and query sets.
information retrieval, nearest neighbors, data query, road networks, network monitoring, query optimization
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
VLDB 2006: Proceedings of the 32nd International Conference on Very Large Data Bases: September 12-15, 2006, COEX, Seoul, Korea
City or Country
MOURATIDIS, Kyriakos; YIU, Man Lung; PAPADIAS, Dimitris; and MAMOULIS, Nikos.
Continuous Nearest Neighbor Monitoring in Road Networks. (2006). VLDB 2006: Proceedings of the 32nd International Conference on Very Large Data Bases: September 12-15, 2006, COEX, Seoul, Korea. 43-54. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/872
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.