The week's pick
Random Articles
Reseach Article
Reachable Nearest Neighbour Query Processing of R-Trees for Moving Query Object
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 49 - Number 17 |
| Year of Publication: 2012 |
| Authors: Anitha Yarava, S. Murali Krishna |
10.5120/7716-0954
|
Anitha Yarava, S. Murali Krishna . Reachable Nearest Neighbour Query Processing of R-Trees for Moving Query Object. International Journal of Computer Applications. 49, 17 ( July 2012), 1-3. DOI=10.5120/7716-0954
Abstract
Efficient storage and retrieval of multidimensional data in large volumes has become one of the key issues in the design and implementation of commercial and application software. The kind of queries posted on such data is also multifarious. Nearest neighbor queries are one such category and have more significance in GIS type of application. R-tree and its sequel are data partitioned hierarchical multidimensional indexing structures that help in this purpose. While general approaches are available in literature that discussing finding of Nearest neighbor for moving query point, few have explored on visible NN queries, but retrieved NN object may not always be reachable from the query object, since some obstacle objects (i. e. Hills, Rivers, Vallies) might be in between query point and NN point. This paper proposes Reachable Nearest neighbor queries for moving query object. The results are compared graphically with existing models, the proposed model out performs the existing models in a significant way.
References
- Guttman, A,, "R-trees,: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 47-57, June 1984.
- Yannis Manolopoulos Alexandros Nanopolos Apostolos N. Papadopolos, "R-trees Have Grown Everywhere" ACM Computing Surveys, Vol. V, No. N, Month 20YY.
- Nick Roussopoulos Stephen Kelley Fr6d6ric Vincent "Nearest Neighbor Queries" SIGMOD'95,San Jose, CA USA Q 1995 ACM 0-89791-731 -6/95/0005. .
- Yunjun Gao • Baihua Zheng • Gencai Chen •Qing Li • Xiaofa Guo" Continuous visible nearest neighbor query processing in spatial databases" The VLDB Journal (2011) 20:371–396 DOI 10. 1007/s00778-010-0200-
- . Dimitris Papadias, Yannis Theodoridis1, Timos Sellis1" The Retrieval of Direction Relations using R-trees", In the Proceedings of the 5th International Conference on Databases and Expert Systems Applications, DEXA, 1994, Springer
- Wu, W. , Guo, W. , Tan, K. L. : Distributed processing of moving k-nearest-neighbor query on moving objects. In: ICDE, pp. 1116–1125 (2007).
- Yufei Tao, Jun Zhang, Dimitris Papadias, "An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium dimensional Spaces," IEEE Transactions on knowledge and data engineering, Vol. 12, No. 1, Oct2004.
- Gao,Y. , Zheng, B. , Lee,W. C. ,Chen, G. :Continuous visible nearest neighbor queries. In: EDBT, pp. 144–155 (2009)
- Yannis Theodoridis, Emmanuel Stefanakis, and Timos Sellis, "Efficient Cost Models for Spatia Queries Using R-Trees" IEEE Transactions on Knowledge And Data Engineering, Vol 12,NO January 2000.
Index Terms
Keywords