S. Sao, Sphurti and Sheikh, Dr. Rahila Nearest Neighbor Search with Keywords in Spatial Databases. International Journal of Computer Science and Network - IJCSN, 2016, vol. 5, n. 5, pp. 776-781. [Journal article (Paginated)]
Text
Nearest-Neighbor-Search-with-Keywords-in-Spatial-Databases.pdf Download (1MB) |
English abstract
In real world, there are billions of rows in a spatial database. If someone want to search for a location or place, it searches all the rows and return the result. Practically there can be only few rows in the database which are of importance to use. As with many pioneering solutions, the IR2-tree has a few drawbacks that affect its efficiency. The most serious issue among all is that the number of false hits can be really very large when the object of final result is far away from the query point, or the result is empty. In such cases, the query algorithm would need to load the documents of many objects, causing expensive overhead as each loading necessitates a random access. So if search is performed only in the used data subspace, the execution time would be saved. We propose such system which can implement this efficiently with the help of R-tree and Nearest neighbor algorithm using inverted Index spatial R-Tree to solve this problem.
Item type: | Journal article (Paginated) |
---|---|
Keywords: | Nearest Neighbor Search, R-Tree, Spatial Database, Spatial Query |
Subjects: | L. Information technology and library technology > LN. Data base management systems. |
Depositing user: | IJCSN Journal |
Date deposited: | 22 Nov 2016 08:24 |
Last modified: | 22 Nov 2016 08:24 |
URI: | http://hdl.handle.net/10760/30190 |
References
Downloads
Downloads per month over past year
Actions (login required)
View Item |