A road network embedding technique for K-nearest neighbor search in moving object databases

GeoInformatica

Volumn 7, Issue 3, 2003, Pages 255-273

  Shahabi, Cyrus ^a   Kolahdouzan, Mohammad R ^a   Sharifzadeh, Mehdi ^a  

^a University of Southern California ^*  (United States)

Author keywords

Chessboard metric; GIS; K nearest neighbors; Metric space; Minkowski metrics; Moving objects; Road networks; Shortest path; Space embedding; Spatial databases

Indexed keywords

INFORMATION RETRIEVAL;

SPATIAL INDEX STRUCTURES;

GEOGRAPHIC INFORMATION SYSTEMS;

DATABASE; GIS; NEAREST NEIGHBOR ANALYSIS; ROAD; SPATIAL DATA;

EID: 0141794311     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025153016110     Document Type: Article

References (12)

1. S. Berchtold, B. Ertl, D.A. Keim, H.-P. Kriegel, and T. Seidl. "Fast nearest neighbor search in high-dimensional spaces," in Proc. l4th IEEE Conf. Data Engineering, ICDE, 23-27, 1998.
2. S. Berchtold, D.A. Keim, and H.-P. Kriegel. "The X-tree: An index structure for high-dimensional data," in Proceedings of the 22nd International Conference on Very Large Databases, 28-39, Morgan Kaufmann Publishers, San Francisco, U.S.A., 1996.
3. C. Faloutsos and K.-I. Lin. "Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets," in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, 163-174, ACM Press, May 22-25, 1995.
4. H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A.E. Abbadi. "Constrained nearest neighbor queries," in SSTD, Redondo Beach, USA, 257-278, July 12-15, 2001.
5. A. Guttman. "R-trees: A dynamic index structure for spatial searching," in SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, 47-57, ACM Press, June 18-21, 1984.
6. S.L. Hakimi, M. Labbe, and E. Schmeichel. "The voronoi partition of a network and its implications in location theory," in ORSA Journal on Computing, Vol. 4, 1992.
7. G.R. Hjaltason and H. Samet. "Distance browsing in spatial databases," in ACM Transactions on Database Systems, Vol. 24, 265-318, 1999.
8. N. Linial, E. London, and Y. Rabinovich. "The geometry of graphs and some of its algorithmic applications," in IEEE Symposium on Foundations of Computer Science, 577-591, 1994.
9. N. Roussopoulos, S. Kelley, and F. Vincent. "Nearest neighbor queries," in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, 71-79, ACM Press, May 22-25, 1995.
10. Z. Song and N. Roussopoulos. "K-nearest neighbor search for moving query point," in SSTD, Redondo Beach, USA, July 12-15, 2001.
11. Y. Tao, D. Papadias, and Q. Shen. "Continuous nearest neighbor search," in Proceedings of the Very Large Data Bases Conference (VLDB), Hong Kong, China, 2002.
12. C. Yu, B.C. Ooi, K.-L. Tan, and H.V. Jagadish. "Indexing the distance: An efficient method to KNN processing," The VLDB Journal, 421-430, 2001.