Nearest Neighbor Search on Moving Object Trajectories in Secondo
In the context of databases storing histories of movement (also called trajectories), we present two query processing operators to compute the k nearest neighbors of a moving query point within a set of moving points. Data moving points are represented as collections of point units (i.e., a time interval together with a linear movement function). The first operator, knearest, processes a stream of units arriving ordered by start time and returns the set of units representing the k nearest neighbors over time. It can be used to process a set of moving point candidates selected by other conditions. The second operator, knearestfilter, operates on a set of units indexed in an R-tree and uses some novel pruning techniques. It returns a set of candidates that can be further processed by knearest to obtain the final answer. These nearest neighbor algorithms are presented within Secondo, a complete DBMS environment for handling moving object histories. For example, candidates and final results can be visualized and animated at the user interface.
Unable to display preview. Download preview PDF.
- 1.Düntgen, C., Behr, T., Güting, R.H.: BerlinMOD: A benchmark for moving object databases. The VLDB Journal (online first, 2009)Google Scholar
- 4.Güting, R.H., Behr, T., Xu, J.: Efficient k-nearest neighbor search on moving object trajectories (manuscript in preparation, 2009)Google Scholar
- 6.Güting, R.H., de Almeida, V.T., Ansorge, D., Behr, T., Ding, Z., Höse, T., Hoffmann, F., Spiekermann, M., Telle, U.: SECONDO: An extensible DBMS platform for research prototyping and teaching. In: ICDE, pp. 1115–1116. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 7.Secondo Web Site (2009), http://dna.fernuni-hagen.de/Secondo.html/index.html