Approaching Neighbors in Efficient and Fastest Manner

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)
© 2014 by IJCTT Journal
Volume-15 Number-3
Year of Publication : 2014
Authors : Chande Rajashekar , Shankar Thalla

MLA

Chande Rajashekar , Shankar Thalla. " Approaching Neighbors in Efficient and Fastest Manner ". International Journal of Computer Trends and Technology (IJCTT) V15(3):140-144, Sep 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
General spatial queries, like as nearest neighbor retrieval and range search, contains only restrictions on objects’ geometric characteristics. Presently, lots of trendy apps call for new forms of queries that target to discover objects fulfilling both a predicate on their related texts and spatial predicate. For sample case, rather considering all the bookstalls, a query of nearest neighbor would rather ask for the bookstall that is the nearest among those whose catalog contain “Drama, scientific, comics” all at the same place. Present the most excellent solution to those queries is depending on the IR2-tree, which was explored in this thesis has a few shortages that seriously affect its efficiency. Due to these circumstances, we build up a new access process known as the spatial inverted index that enlarges the conventional inverted index to manage with multidimensional information and along with algorithms that can respond nearest neighbor queries with the help of keywords in particular time. As confirmed by tests the projected techniques do better than the IR2-tree in query reply time appreciably, often by a aspect of magnitude orders.

References
[1] S. Agrawal, S. Chaudhuri, and G. Das. Dbxplorer: A system for keyword-based search over relational databases. In Proc. Of International Conference on Data Engineering (ICDE), pages 5–16, 2002.
[2] N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. of ACM Management of Data (SIGMOD), pages 322–331, 1990.
[3] G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using banks. In Proc. of International Conference on Data Engineering (ICDE), pages 431–440, 2002.
[4] X. Cao, L. Chen, G. Cong, C. S. Jensen, Q. Qu, A. Skovsgaard, D. Wu, and M. L. Yiu. Spatial keyword querying. In ER, pages 16–29, 2012.
[5] X. Cao, G. Cong, and C. S. Jensen. Retrieving top-k prestige-based relevant spatial web objects. PVLDB, 3(1):373–384, 2010.
[6] X. Cao, G. Cong, C. S. Jensen, and B. C. Ooi. Collective spatial keyword querying. In Proc. of ACM Management of Data (SIG-MOD), pages 373–384, 2011.
[7] B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The bloomier filter: an efficient data structure for static support lookup tables. In Proc. of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 30–39, 2004.
[8] Y.-Y. Chen, T. Suel, and A. Markowetz. Efficient query processing in geographic web search engines. In Proc. of ACM Management of Data (SIGMOD), pages 277–288, 2006.
[9] E. Chu, A. Baid, X. Chai, A. Doan, and J. Naughton. Combining keyword search and forms for ad hoc querying of databases. In Proc. of ACM Management of Data (SIGMOD), 2009. [10] G. Cong, C. S. Jensen, and D. Wu. Efficient retrieval of the top-k most relevant spatial web objects. PVLDB, 2(1):337–348, 2009.
[11] C. Faloutsos and S. Christodoulakis. Signature files: An access method for documents and its analytical performance evaluation. ACM Transactions on Information Systems (TOIS), 2(4):267–288, 1984.
[12] I. D. Felipe, V. Hristidis, and N. Rishe. Keyword search on spatial databases. In Proc. of International Conference on Data Engineering (ICDE), pages 656–665, 2008.
[13] R. Hariharan, B. Hore, C. Li, and S. Mehrotra. Processing spatialkeyword (SK) queries in geographic information retrieval (GIR) systems. In Proc. of Scientific and Statistical Database Management (SSDBM), 2007.
[14] G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems (TODS), 24(2):265–318, 1999.
[15] V. Hristidis and Y. Papakonstantinou. Discover: Keyword search in relational databases. In Proc. of Very Large Data Bases (VLDB), pages 670–681, 2002.
[16] I. Kamel and C. Faloutsos. Hilbert R-tree: An improved r-tree using fractals. In Proc. of Very Large Data Bases (VLDB), pages 500–509, 1994.
[17] J. Lu, Y. Lu, and G. Cong. Reverse spatial and textual k nearest neighbor search. In Proc. of ACM Management of Data (SIGMOD), pages 349–360, 2011.
[18] S. Stiassny. mathematical analysis of various superimposed coding methods. Am. Doc., 11(2):155–169, 1960.
[19] J. S. Vitter. Algorithms and data structures for external memory. Foundation and Trends in Theoretical Computer Science, 2(4):305–474, 2006.
[20] D. Zhang, Y. M. Chee, A. Mondal, A. K. H. Tung, and M. Kitsuregawa. Keyword search in spatial databases: Towards searching by document. In Proc. of International Conference on Data Engineering (ICDE), pages 688–699, 2009.

Keywords
Nearest Neighbor Search, Keyword Search, Spatial Index