Implementation of Nearest Neighbor Retrieval

Authors

  • Reddy SP Department of Computer Science, Sri Venkateswara University, Tirupati, India
  • Govindarajulu P Department of Computer Science, Sri Venkateswara University, Tirupati, India

Keywords:

SI Index, IR Tree, Fast Nearest, Neighbor

Abstract

Conventional pensiveness queries, like contrast search and nearby neighbor retrieval involve completely on conditions imposed on objects of geometric properties. Nowadays, various applications absorb new types of queries that aspire to hunt out objects satisfying every generalization predicate and a predicate on connected texts. as Associate in Nursing example, instead of considering all the restaurants, a nearest neighbor question would instead elicit the edifice that is the utmost among those whose menu contain “steak, spaghetti, sprite” all at a similar time. Presently the foremost effective resolution to such queries is based on the IR2-tree, which, as shown throughout this paper, aims at a couple of deficiencies that seriously impact its efficiency. motivated by this, we have a tendency to tend to develop a replacement access methodology called the abstraction inverted index with the intention of extends the quality inverted index to deal with flat data, and comes with algorithms that will answer nearby neighbor queries through keywords in real time. As verified by experiments, the projected techniques outgo the IR2-tree and are subjected to significantly, generally by a component of, orders of magnitude.

References

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

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.

G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudar- shan. Keyword searching and browsing in databases using banks. In Proc. of International Conference on Data ngineering (ICDE), pages 431–440, 2002.

V. Maniraj, R .Mary, "Productive K-Nearest Neighbor (PKNN) and Index Based Positioning for Keyword Search", International Journal of Computer Sciences and Engineering, Vol.4(4), pp.379-383, Apr -2016

X. Cao, G. Cong, and C. S. Jensen. Retrieving top-k prestige-based relevant spatial web objects. PVLDB, Vol. 3(1):373–384, 2010.

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.

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.

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.

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.

Downloads

Published

2025-11-11

How to Cite

[1]
S. Reddy and P. Govindarajulu, “Implementation of Nearest Neighbor Retrieval”, Int. J. Comp. Sci. Eng., vol. 5, no. 2, pp. 51–57, Nov. 2025.

Issue

Vol. 5 No. 2 (2017): IJCSE February Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.