EFFICIENT METHOD TO FIND NEAREST NEIGHBOR WITH KEYWORDS IN MULTIDIMENSIONAL DATABASES
Sandhya Venu
M-Tech student CSE, Department Of Computer Science, Mohandas College of Engineering and Technology
Manju M Menon
Assistant Professor in IT, Department Of Information Technology Mohandas College of Engineering and Technology
Receiving Date:
2015-09-06
Acceptance Date:
2015-10-07
Publication Date:
2015-11-02
Download PDF
Abstract
Nowadays the applications on spatial databases are tremendously increasing. The location based
searches from spatial databases are widely used for both research and commercial purposes. The inputs
of a spatial keyword query are a user defined location and number of keywords. The output is the object
which satisfies both the location and keyword requirements. The most important part of a spatial
keyword query is the geo-textual index. Extended researches are being carried out in field of geo-textual
indices. This thesis proposes a parallel R-Tree construction method for geo textual indexing. Using this
method we can reduce the construction time compared to the existing methods. We propose a new
hybrid indexing mechanism namely Kd-B tree which has the combined advantage of kd tree and bitmap
indexing. This reduces the time and space consumption remarkably. Based on the experiments
conducted we can see that the time and space is considerably saved by constructing Kd-B tree.
Keywords:
Spatial keyword query, Geo-textual indices, Spatial- inverted index.
References
- A Guttman „R-trees a dynamic index structure for spatial searching‟, Proc ACM SIGMOD Int Conf on Management of Data, 47-57, 1984
- 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.
- R. Hariharan, B. Hore, C. Li, and S. Mehrotra. Processing spatial-keyword (sk) queries in geographic information retrieval (gir systems. In SSDBM, page 16, 2007.
- Y. Zhou, X. Xie, C. Wang, Y. Gong, and W.-Y. Ma. Hybrid index structures for locationbased web search. In CIKM, pages 155–162, 2005
- A. Cary, O. Wolfson, and N. Rishe. Efficient and scalable method for processing top-k spatial boolean queries. In SSDBM, pages 87–95, 2010.
- I.D. Felipe, V. Hristidis, and N. Rishe. Keyword search on spatial databases. In ICDE, pages 656–665, 2008.
- D. Wu, M. L. Yiu, G. Cong, and C. S. Jensen. Joint top-k spatial keyword query processing. IEEE TKDE, 24(10):1889–1903, 2012.
- J. B. Rocha-Junior, O. Gkorgkas, S. Jonassen, and K. Nørv°ag. Efficient processing of top-k spatial keyword queries. In SSTD, pages 205–222,2011.
- 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.
- D. Zhang, Y. M. Chee, A. Mondal, A. K. H. Tung, and M. Kitsuregawa. Keyword search in spatial databases: Towards searching by document. In ICDE, pages 688–699, 2009.
- A. Khodaei, C. Shahabi, and C. Li. Hybrid indexing and seamless ranking of spatial and textual features of web documents. In DEXA, pages 450–466, 2010.
- S. Vaid, C. B. Jones, H. Joho, and M. Sanderson. Spatio-textual indexing for geographical search on the web. In SSTD, pages 218–235,2005.
- Y.-Y. Chen, T. Suel, and A. Markowetz. Efficient query processing in geographic web search engines. In SIGMOD, pages 277–288, 2006.
- Yufei Tao and Cheng Sheng, 'Fast Nearest Neighbor Search with Keywords. ', In IEEE ,TKDE, VOL. 26, NO. 4, APRIL 2014.
Back
