Abstract
Nearest neighbor queries have received much interest in recent years due to their increased importance in advanced database applications. However, past work has addressed such queries in a static setting. In this paper we consider instead a dynamic setting where data objects move continuously. Such a mobile spatiotemporal environment is motivated by real life applications in traffic management, intelligent navigation and cellular communication systems. We consider two versions of nearest neighbor queries depending on whether the temporal predicate is a single time instant or an interval. For example: “find the closest object to a given object o after 10 minutes from now”, or, “find the object that will be the closest to object o between 10 and 15 minutes from now”. Since data objects move continuously it is inefficient to update the database about their position at each time instant. Instead our approach is to employ methods that store the motion function of each object and answer nearest neighbor queries by efficiently searching through these methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P. Agarwal and M. Sharir. Arrangements and their applications. in Handbook of Computational Geometry, (J. Sack, ed.), North Holand, Amsterdam. 132
ArcView GIS. ArcView Tracking Analyst. 1998. 120
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, to appear. 132
N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method For Points and Rectangles. In Proc. ACM-SIGMOD International Conference on Management of Data, pages 322–331, Atlantic City, May 1990. 126
S. Berchtold, C. Bohm, D. Keim, H.-P. Kriegel. A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. In Proc. 16th ACM-PODS, pp. 78–86, 1997. 125
J. Chomicki and P. Revesz. A Geometric Framework for Specifying Spatiotemporal Objects. Proc. 6th International Workshop on Time Representation and Reasoning, May 1999. 120
D. Comer. The Ubiquitous B-Tree. Computing Surveys, 11(2):121–137, June 1979.
M. Erwig, R. H. Guting, M. Schneider and M. Vazirgianis. Spatio-temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases. In Proc. of ACM GIS Symposium’ 98. 119, 120
G. Evangelidis, D. Lomet, and B. Salzberg. The hB?-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation. In Proc. 21st International Conference on Very Large Data Bases, Zurich, September 1995, pages 551–561. 126
V. Gaede and O. Gunther. Multidimensional Access Methods. ACM Computing Surveys, 30(2):170–231, 1998. 126
A. Guttman. R-Trees: A Dynamic Index Structure For Spatial Searching. In Proc. ACM-SIGMOD International Conference on Management of Data, pages 47–57, Boston, June 1984. 126
G. R. Hjaltason and H. Samet. Ranking in Spatial Databases. In Proc. 4th Int. Symp. on Spatial Databases, pp. 83–95, 1995. 125, 126, 131
P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proc.30th ACM-STOC, pp. 604–613, 1998. 132
H. V. Jagadish. On Indexing Line Segments. In Proc. 16th International Conference on Very Large Data Bases, pages 614–625, Brisbane, Queensland, Australia, August 1990. 123, 125
J. Kleinberg. Two Algorithms for Nearest-Neighbor Search in High Dimensions. In Proc. 29th ACM-STOC, pp. 599–608, 1997. 132
G. Kollios, D. Gunopulos and V. J. Tsotras. On Indexing Mobile Objects. In Proc. 18th ACM-PODS, 1999. 120, 121, 122, 124, 126, 130
N. Roussopoulos, S. Kelley, F. Vincent. Nearest Neighbor Queries. In Proc. ACMSIGMOD Int. Conf. on Management of Data, pages 71–79, June 1992. 125, 131
H. Samet. The Design and Analysis of Spatial Data Structures., Addison-Wesley, Reading, MA, 1990. 126
T. Sellis, N. Roussopoulos and C. Faloutsos. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In Proc. 13rd International Conference on Very Large Data Bases, pages 507–518, Brighton, England, September 1987. 126
A. P. Sistla, O. Wolfson, S. Chamberlain, S. Dao. Modeling and Querying Moving Objects. In Proc. 13th IEEE International Conference on Data Engineering, pages 422–432, Birmingham, U.K, April 1997. 120
O. Wolfson, S. Chamberlain, S. Dao, L. Jiang, G. Mendez. Cost and Imprecision in Modeling the Position of Moving Objects. In Proc. 14th IEEE International Conference on Data Engineering, pages 588–596, Orlando, Florida, February 1998. 120
O. Wolfson, B. Xu, S. Chamberlain, L. Jiang. Moving Objects Databases: Issues and Solutions In Proceedings of the 10th International Conference on Scientific and Statistical Database Management. Capri, Italy, July 1998. 120
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kollios, G., Gunopulos, D., Tsotras, V.J. (1999). Nearest Neighbor Queries in a Mobile Environment. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds) Spatio-Temporal Database Management. STDBM 1999. Lecture Notes in Computer Science, vol 1678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48344-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-48344-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66401-7
Online ISBN: 978-3-540-48344-1
eBook Packages: Springer Book Archive