Algorithms for Nearest Neighbor Search on Moving Object Trajectories

R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis. “Nearest neighbor and reverse nearest neighbor queries for moving objects,” in Proceedings of IDEAS, 2002.

S. Babu and J. Widom. “Continuous queries over data streams,” SIGMOD Record, Vol. 30(3):109–120, 2001 (September).

K.L. Cheung and A.W. Fu. “Enhanced nearest neighbour search on the R-tree,” SIGMOD Record, Vol. 27(3):16–21, 1998 (September).

A. Guttman. “Rtrees: A dynamic index structure for spatial searching,” in Proceedings of ACM SIGMOD, 1984.

G. Hjaltason and H. Samet. “Distance browsing in spatial databases,” ACM Transactions on Database Systems, Vol. 24(2):265–318, 1999.

H. Hu, J. Xu, and D.L. Lee. “A generic framework for monitoring continuous spatial queries over moving objects,” in Proceedings of ACM SIGMOD, 2005.

G.S. Iwerks, H. Samet, and K. Smith, “Continuous K-nearest neighbor queries for continuously moving points with updates,” in Proceedings of VLDB, 2003.

Y. Manolopoulos, A. Nanopoulos, A.N. Papadopoulos, and Y. Theodoridis. R-trees: Theory and Applications. Springer: Berlin Heidelberg New York, 2005.

K. Mouratidis, M. Hadjieleftheriou, and D. Papadias. “Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring,” in Proceedings of ACM SIGMOD, 2005.

M.F. Mokbel, X. Xiong, and W.G. Aref, “SINA: Scalable incremental processing of continuous queries in spatio-temporal databases,” in Proceedings of ACM SIGMOD, 2004.

D. Pfoser, C.S. Jensen, and Y. Theodoridis, “Novel approaches to the indexing of moving object trajectories,” in Proceedings of VLDB, 2000.

N. Roussopoulos, S. Kelley, and F. Vincent. “Nearest neighbor queries,” in Proceedings of ACM SIGMOD, 1995.

S. Saltenis, C.S. Jensen, S. Leutenegger, and M. Lopez. “Indexing the positions of continuously moving objects,” in Proceedings of ACM SIGMOD, 2000.

C. Shahabi, M. Kolahdouzan, and M. Sharifzadeh. “A road network embedding technique for K-nearest neighbor search in moving object databases,” GeoInformatika, Vol. 7(3):255–273, 2003.

Z. Song and N. Roussopoulos. “K-nearest neighbor search for moving query point,” in Proceedings of SSTD, 2001.

Y. Tao and D. Papadias, “Time parameterized queries in spatio-temporal databases,” in Proceedings of ACM SIGMOD, 2002.

Y. Tao, D. Papadias, and Q. Shen. “Continuous nearest neighbor search,” Proceedings of VLDB, 2002.

Y. Theodoridis. “The R-tree portal,” URL: http://www.rtreeportal.org (accessed 13 December 2005).

Y. Theodoridis, J.R.O. Silva, and M.A. Nascimento. “On the generation of spatio-temporal datasets,” in Proceedings of SSD, 1999.

Y. Tao, J. Sun, and D. Papadias. “Analysis of predictive spatio-temporal queries,” ACM Transactions on Database Systems, Vol. 28(4):295–336, 2003 December.

Y. Theodoridis, M. Vazirgiannis, and T. Sellis. “Spatio-temporal indexing for large multimedia applications.” in Proceedings of ICMCS, 1996.

X. Yu, K. Pu, and N. Koudas. “Monitoring k-nearest neighbor queries over moving objects,” in Proceedings of ICDE, 2005.

X. Xiong, M. Mokbel, and W. Aref. “SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases,” in Proceedings of ICDE, 2005.