Improving Efficiency of Nearest Neighbor Search by Utilizing Spatial Inverted Index

  • Authors

    • V Vijay Kumar
    • S V.L. Gayathri
    • K Roshini
    • E Rohith
    2018-05-31
    https://doi.org/10.14419/ijet.v7i2.32.15729
  • SI Index, Information Retrieval R Tree, multidimensional items, closest neighbor searches.
  • Spatial queries with regular strategies like range request or closest neighbor Search include just the utilization of geometric properties of the items. An up-to-date answer for looking troublesome inquiries utilizes IR-tree technique and we have examined it in the paper. We propose another strategy with a goal of finding the closest neighbor of the inquiry while decreasing the delay time caused in looking what's more, enchasing the of the aftereffect of a question. Many web indexes are utilized to appear everything from everywhere; this framework is utilized to quick closest neighbor seek to utilize a watchword. Previous works, generally, emphasis on searching top-k Near Neighbors, each center point needs to facilitate the total addressing the Key words. The thickness over information protests over the space is not reflected. In the same manner, these methods are little proficient for an incremental query. Information Retrieval R Tree having a few disadvantages. The output of Information Retrieval R Tree gravely was pretentious due to rare disadvantages. Overcome with problem must to be observed. The resultant record is the technique of getting response over this issue.

     

  • References

    1. [1] S. Agrawal, S. Chaudhuri, and G. Das, “Dbxplorer: A System for Keyword-Based Search over Relational Databases,†Proc. Int’l Conf. Data Eng. (ICDE), pp. 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,†Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 322-331, 1990.

      [3] G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan, “Keyword Searching and Browsing in Databases Using Banks,†Proc. Int’l Conf. Data Eng. (ICDE), pp. 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,†Proc. 31st Int’l Conf. Conceptual Modeling (ER), pp. 16-29, 2012.

      [5] X. Cao, G. Cong, and C.S. Jensen, “Retrieving Top-k Prestige Based Relevant Spatial Web Objects,†Proc. VLDB Endowment, vol. 3, no. 1, pp. 373-384, 2010.

      [6] 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.

      [7] B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, “The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables,†Proc. Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 30- 39, 2004.

      [8] 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.

      [9] E. Chu, A. Baid, X. Chai, A. Doan, and J. Naughton, “Combining Keyword Search and Forms for Ad Hoc Querying of Databases,†Proc. ACM SIGMOD Int’l Conf. Management of Data, 2009.

      [10] 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.

      [11] 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.

  • Downloads

  • How to Cite

    Vijay Kumar, V., V.L. Gayathri, S., Roshini, K., & Rohith, E. (2018). Improving Efficiency of Nearest Neighbor Search by Utilizing Spatial Inverted Index. International Journal of Engineering & Technology, 7(2.32), 416-419. https://doi.org/10.14419/ijet.v7i2.32.15729