Spatial databases have enormous number of applications, especially in mobile and wireless communications. Range queries are one of the best available tools to retrieve useful information from these databases. Range query usually returns large results. These results are neither communication effective nor informative. Finding spatial data that fit best for the intended use is the main challenge of all spatial search engines. Result of search for spatial data is a list of all items indicated as relevant by the algorithm used in the search engine. Depending on the type of input to the system, various techniques can be used for ranking the results. In order to address these problems, we propose an idea of r-tree based searching and ranking. Such an r-tree based searching & ranking reduces the costs of communication, increases the Usefulness, and also provides interactive exploration. Proposed system defines that the handheld device query will be provided effectively and nontrivial algorithm found good results approximately.

1. Carlos Ordonez, Il-Yeol Song ,Carlos Garcia-Alvarado ,"Relational versus non-relational database systems for data warehousing," DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP,2010.
2. K. Yi, X. Lian, F. Li, and L. Chen, "The world in a nutshell: Concise range queries," IEEE Transactions on Knowledge and Data Engineering, Vol. 23, No. 1, January 2011.
3. Hanan Samet," Spatial Data Structures," Modern Database Systems: The Object Model, Interoperability, and Beyond, W. Kim, ed. , Addison Wesley/ACM Press, Reading, MA, 361-385, 1995.
4. A. Guttman, "R-trees: a dynamic index structure for spatial searching," in SIGMOD, 1984.
5. B. Moon, H. v. Jagadish, C. Faloutsos, and J. H. Saltz, "Analysis of the Clustering Properties of the Hilbert Space-Filling Curve," IEEE Trans. Knowledge and Data Eng. , vol. 13, no. 1, pp. 124-141, Jan. 2001.
6. Lee, K. C. K. , Baihua Zheng, Wang-Chien Lee , Dik Lun Lee, Xufa Wang," IR-Tree: An Efficient Index for Geographic Document Search," ," IEEE Trans. Knowledge and Data Eng,vol 23,pp 585-599,April 2011.
7. Hung Chim , Xiaotie Deng ," Efficient Phrase-Based Document Similarity for Clustering," IEEE Trans. Knowledge and Data Eng,vol 20,pp 1217-1219,Sep 2008.
8. Sulieman Bani-Ahmad, Ali Cakmak, and Gultekin Ozsoyoglu," Evaluating Publication Similarity Measures," Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 2005.
9. S. Acharya, V. Poosala, and S. Ramaswamy, "Selectivity Estimation in Spatial Databases," Proc. ACM SIGMOD, 1999.
10. N. Dalvi and D. Suciu, "Efficient Query Evaluation on Probabilistic Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
11. R. Cheng, D. Kalashnikov, and S. Prabhakar, "Evaluating Probabilistic Queries over Imprecise Data," Proc. ACM SIGMOD, 2003.
12. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom, "Working Models for Uncertain Data," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
13. C. S. Jensen, D. Lin, B. C. Ooi, and R. Zhang, "Effective Density Queries on Continuously Moving Objects," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
14. P. K. Agarwal, L. Arge, and J. Erickson, "Indexing Moving Points,"Proc. Symp. Principles of Database Systems (PODS), 2000.
15. Y. Tao, D. Papadias, and J. Sun, "The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003

Spatial Databases Searching Algorithms