Simple and Incremental Nearest-Neighbor Search for Spatiotemporal Databases

The efficient processing of nearest-neighbor queries in databases of moving objects is considered very important for applications such as fleet management, traffic control, digital battlefields and more. Such applications have been rapidly spread due to the fact that mobile computing and wireless technologies nowadays are ubiquitous. This chapter presents important aspects towards simple and incremental nearest-neighbor search for spatiotemporal databases. More specifically, we describe the algorithms that This chapter appears in the book Spatial Databases: Technol gi s, Techniques and Trends by Yannis Manalopoulos, Apost los Papado oulos and Michael Gr. Vassilakopoulos. Copyright © 2005, Idea Group Inc. Copying or distributing in print or electronic forms without written permission of Idea Group Inc. is prohibited. 701 E. Chocolate Avenue, Suite 200, Hershey PA 17033-1240, USA Tel: 717/533-8845; Fax 717/533-8661; URL-http://www.idea-group.com IDEA GROUP PUBLISHING Simple and Incremental Nearest-Neighbor Search in Spatio-Temporal Databases 205 Copyright © 2005, Idea Group Inc. Copying or distributing in print or electronic forms without written permission of Idea Group Inc. is prohibited. have already been proposed for simple and incremental nearest neighbor queries and present a new algorithm regarding that issue. Finally, we study the problem of keeping a query consistent in the presence of insertions, deletions and updates of moving objects.