Today many applications use a new forms of query
called as spatial keyword query which include finding objects
closest to a specified location that contains specific set of
keywords. For example, "find the nearest hotels to a specific
location that contain facilities free lunch and dry cleaning". Such
query would ask for the hotels that are closest among those
which provides facilities "free lunch and dry cleaning" all at the
same time instead of considering all the hotels. Currently using
IR2-tree is the best solution to such queries, which has a few
deficiencies that seriously impact its efficiency. In this paper,
we present a review on various methods used for NN search
with keywords.
Ms. Shubhada Phakatkar : is pursuing Masters of Engineering from
Pune University, did her B. E in CE from Pune University in 2009 and
completed her MBA in Computer Application from Pune University in
2013.
Dr. S.T.Singh : Professor and campus director of CE in PK
Technical campus, Completed ME (CE) and PhD. He has 10 years
of industrial and 9 years of teaching experience.
Nearest Neighbor Search
Spatial Database
Spatial Inverted Index
Keyword Search
This paper presents the survey of various techniques for
nearest neighbor search for spatial database. As in the
previous methods there were many drawbacks. The
existing solutions incur too expensive space consumption or they are unable to give real time answer. So to
overcome the drawbacks of previous methods, new
method is based on variant of inverted index and R-tree
and algorithm of minimum bounding method is used to
reduce the search space. This method will increase the
efficiency of nearest neighbor search too.
[1] 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.
[2] 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.
[3] 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.
[4] 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.
[5] I.D. Felipe, V. Hristidis, and N. Rishe, “Keyword
Search on Spatial Databases,” Proc. Int’l Conf. Data
Eng. (ICDE), pp. 656-665, 2008.
[6] Yufei Tao and Cheng Sheng, “Fast Nearest Neighbor
Search with Keywords”, IEEE transactions on
knowledge and data engineering, VOL. 26, NO. 4,
APRIL 2014.
[7] N. Beckmann, H. Kriegel, R. Schneider, and B.
Seeger, “The R -tree: An Efficient and Robust Access
Method for Points and Rectangles,” Proc. ACM
SIGMOD Int’l Conf. Management of Data,pp. 322-
331, 1990.
[8] C. Faloutsos and S. Christodoulakis, “Signature Files:
An Access Method for Documents and Its Analytical
Performance Evaluation,” ACM Trans. Information
Systems, vol. 2, no. 4, pp. 267-288, 1984.
[9] G. R. Hjaltason and H. Samet. Distance browsing in
spatial databases. ACM Transactions on Database
Systems (TODS), 24(2):265–318, 1999.
