Continuous k-nearest neighbor search for moving objects

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 16, Issue , 2004, Pages 123-126

  Li, Yifan ^a   Yang, Jiong ^a   Han, Jiawei ^a  

^a University of Illinois ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE ENVIRONMENT; MOVING OBJECTS; TIME-DISTANCE (TD) SPACE;

ALGORITHMS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS); VECTORS;

QUERY LANGUAGES;

EID: 5444228992     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. "The R* - tree: an efficient and robust access method for points and rectangles", SIGMOD, 1990.
2. G.S. Iwerks, H. Samet and K. Smith. "Continuous k-neaiest neighbor queries for continuously moving points with updates", VLDB, 2003.
3. S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez. "Indexing the positions of continuously moving objects", SIGMOD, 2000.
4. Y. Tao and D. Papadias. "Time-parameterized queries in spatio-temporal databases", SIGMOD, 2002.