Nearest Neighbor Search with Keywords in Spatial Databases

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)]

[img] Text

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


"SEEK" links will first look for possible matches inside E-LIS and query Google Scholar if no results are found.

[1] Yufei Tao and Cheng Sheng, “Fast Nearest Neighbor Search with Keywords”, IEEE transactions on knowledge and data engineering, VOL. 26, NO. 4, APRIL 2014. [2] X. Cao, L. Chen, G. Cong, C.S. Jensen, Q. Qu, A. Skovsgaard, D. Wu, and M.L. Yiu, “Spatial Keyword Querying,” Proc. 31st Int’l Conf. Conceptual Modeling (ER), pp. 16-29, 2012.. [3] X. Cao, G. Cong, C.S. Jensen, and B.C. Ooi, “Collective Spatial Keyword Querying,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 373- 384, 2011. [4] J. Lu, Y. Lu, and G. Cong, “Reverse Spatial and Textual k Nearest Neighbor Search,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 349- 360, 2011 [5] D. Zhang, Y.M. Chee, A. Mondal, A.K.H. Tung, and M. Kitsuregawa, “Keyword Search in Spatial Databases: Towards Searching by Document,” Proc. Int’l Conf. Data Eng. (ICDE), pp. 688-699, 2009. [6] G. Cong, C.S. Jensen, and D. Wu, “Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects,” PVLDB, vol. 2, no. 1, pp. 337- 348, 2009. [7] I.D. Felipe, V. Hristidis, and N. Rishe, “Keyword Search on Spatial Databases,” Proc. Int’l Conf. Data Eng. (ICDE), pp. 656-665, 2008. [8] R. Hariharan, B. Hore, C. Li, and S. Mehrotra, “Processing Spatial- Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems,” Proc. Scientific and Statistical Database Management (SSDBM), 2007.[9] Y.-Y. Chen, T. Suel, and A. Markowetz, “Efficient Query Processing in Geographic Web Search Engines,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 277-288, 2006. [10] V. Hristidis and Y. Papakonstantinou, “Discover: Keyword Search in Relational Databases,” Proc. Very Large Data Bases (VLDB), pp. 670-681, 2002 [11] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,”ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318,1999.


Downloads per month over past year

Actions (login required)

View Item View Item