eDAR Algorithm for Continuous KNN Queries Based on Pine

International Journal of Information Technology and Web Engineering (IJITWE)

Volumn 1, Issue 4, 2006, Pages 1-21

  Safar, Maytham ^a   Ebrahimi, Dariush ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

geographic information systems; geospatial data; information search and retrieval

Indexed keywords

EID: 85001720444     PISSN: 15541045     EISSN: 15541053     Source Type: Journal    
DOI: 10.4018/jitwe.2006100101     Document Type: Article

References (22)

1. Berchtold, S., Ertl, B., Keim, D. A., & Kriegel, H. P. (1998). Fast nearest neighbor search in high-dimensional space. In Proceedings of the 14th IEEE Conference on Data Engineering (ICDE) (pp. 209–218).
2. Bozkaya, T, & Ozsoyoglu, M. (1997). Distance-based indexing for high-dimensional metric spaces. In Proceedings of ACM Special Interest Group on Management of Data (SIGMOD) (pp. 357–368).
3. Chiueh, T. (1994). Content-based image indexing. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB) (pp. 582–593).
4. Ciaccia, P., Patella, M., & Zezula, P. (1997). M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB) (pp. 426–435).
5. Corral, A., Manolopoulos, Y., Theodoridis, Y., & Vassilakopoulos, M. (2000). Closest pair queries in spatial databases. In Proceedings of the 2000 ACM International Conference on Management of Data (SIGMOD) (pp. 189–200).
6. Hjaltason, G. R., & Samet, H. (1999). Distance browsing in spatial databases. InProceedings of ACM Transactions on Database Systems, 24(2), 265–318.
7. Jung, S., & Pramanik, S. (2002). An efficient path computation model for hierarchically structured topological road maps. In Proceedings of IEEE Transaction on Knowledge and Data Engineering (TKDE), 14(1), 1029–1046.
8. Kolahdouzan, M., & Shahabi, C. (2004a). Continuous K nearest neighbor queries in spatial network database. In Proceedings of the 2nd Workshop on Spatio-Temporal Database Management (STDBM).
9. Kolahdouzan, M., & Shahabi, C. (2004b). Voronoi-based K nearest neighbor search for spatial network database. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB) (pp. 840–851).
10. Kollios, G., Gunopulos, D., & Tsotras, V. J. (1999). Nearest neighbor queries in a mobile environment. In Proceedings of the International Workshop on Spatio-Temporal Database Management (pp. 119–134).
11. Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., & Protopapas, Z. (1996). Fast nearest neighbor search in medical image databases. In Proceedings of 22nd International Conference on Very Large Data Bases (VLDB) (pp. 215–226).
12. Okabe, A., Boots, B., Sugihara, K., & Chiu, S. N. (2000). Spatial tessellations: Concepts and applications of Voronoi diagrams (2nd ed.). John Wiley & Sons.
13. Papadias, D., Zhang, J., Mamoulis, N., & Tao, Y. (2003). Query processing in spatial network databases. In Proceedings of 29th International Conference on Very Large Data Bases (pp. 802–813).
14. Rigaux, P., Scholl, M., & Vorsard, A. (2001). Spatial databases with applications to GIS. Morgan Kaufmann, Inc.: San Francisco.
15. Roussopoulos, N., Kelley, S., & Vincent, F. (1995). Nearest neighbor queries. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), 24(2), 71–79.
16. Safar, M. (2005). K nearest neighbor search in navigation systems. Journal of Mobile Information Systems (MIS), 1(3), 1–18.
17. Saltenis, S., Jensen, C. S., Leutenegger, S. T. & Lopez, M. A. (2000). Indexing the positions of continuously moving objects. In Proceedings of the ACM International Conference on Management of Data (SIGMOD) (pp. 331–342).
18. Seidl, T., & Kriegel, H.P. (1998). Optimal multi-step k-nearest neighbor search. In Proceedings ACM International Conference on Management of Data (SIGMOD) (pp. 154–165).
19. Shahabi, C., Kolahdouzan, M., & Sharifzadeh, M. (2002). A road network embedding technique for k-nearest neighbor search in moving object databases. In Proceedings of the 10th ACM International Symposium on Advances in Geographic Information Systems (ACMGIS) (pp. 94–100).
20. Song, Z., & Roussopoulos, N. (2001). K-nearest neighbor search for moving query point. In Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases (pp. 79–96).
21. Tao, Y., Papadias, D., & Shen, Q. (2002). Continuous nearest neighbor search. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB) (pp. 287–298).
22. Yu, C., Ooi, B. C., Tan, K. L., & Jagadish, H. V. (2001). Indexing the distance: An efficient method to KNN processing. In Proceedings of the 27th International Conference on Very Large Data Bases (pp. 421–430).