Indian Journal of Science and Technology
DOI: 10.17485/ijst/2016/v9i1/80395
Year: 2016, Volume: 9, Issue: 1, Pages: 1-10
Original Article
A.Sasi Kumar* and G. Suseendran
School of Computing Sciences, Vels University, Chennai – 600 117, Tamil Nadu, India; [email protected], [email protected]
*Author For Correspondence
A.Sasi Kumar
School of Computing Sciences, Vels University, Chennai – 600 117, Tamil Nadu, India; [email protected]
Background/Objectives: The scope of this proposed work is to minimize the search time and complexity in spatial database. Methods: Improves the query processing in spatial database by using the existing R Tree, IR Tree and Reverse Ranking. A comparative analysis is made between the existing methods and the proposed method Incremental Quality Reverse Ranking (IQRR). The proposed method effectively evaluates to find the top-k spatial objects in multiple query processing. Findings: To evaluate the performance of the proposed approach, a comparative study has been performed in this work. The R tree and IR tree are compared with the proposed work namely Incremental Quality Reverse Ranking (IQRR). The evaluation parameters are radius, time, location, directions and number of dams. Applications: A spatial preference query ranks objects (e.g. Dams) based on the qualities of features (irrigation, water supply, flood control, hydroelectricity, navigation, recreation and pollution control) in their spatial neighborhood. In future, according to the user specification, it may be developed for any spatial network application. This application can be deployed in the cloud server and cloud will provide a service to the user.
Keywords: Indexing Structures, IR-tree, Query Processing, R-tree, Spatial Databases
Subscribe now for latest articles and news.