Designing of Semantic Nearest Neighbor Searc

Authors

  • Anita RP Pawar Student BE Computer, S.B. Patil College of Engineering, Pune , Maharashtra India
  • Tabssum H Mulani Student BE Computer,S.B. Patil College of Engineering, Pune , Maharashtra, India
  • Rajashree B Pansare Student BE Computer, S.B. Patil College of Engineering, Pune ,Maharashtra India
  • Shrimant B Bandgar Asst. Professor, S.B. Patil College of Engineering, Pune ,Maharashtra India

Keywords:

spatial Index, K-mean, keyword-based Apriori item-set, neighbour search

Abstract

Finding out nearest neighbor is successfully implemented with distance as a base for comparison of who is nearest. But in real life we always not satisfied for getting only nearest by distance. Along with shortest distance we may have some goal in our mind for search such as find nearest Medical store in which diabetes medicines are available. In a geography information system, range search can be deployed to find all medical stores in a certain area, while nearest neighbor retrieval can discover the Medical store closest to a given address. Nearest neighbor search useful for any application but in this paper we will implement only medical application, useful for finding nearest medical along with tablet information .the medical is not globally near but medical is nearest along with all requirement of the user that means tablet. User have the authenticated user that means user already registered its account on server is necessary. Medical administrator is 2nd party to modify the backend database user friendly manner. it has the right of modification to all information stored in database server.

References

S. Agrawal , S.Chaudhuri,and G.Das.Dbxplorer: A system for keyword-based search over relational databases. In Proc.Of International Conference on DataEngin-eering (ICDE), pages 516, 2002.

N.Beckmann, H.Kriegel,R.Schneider, and B.Seeger.The R*-tree:Ane_cient and robust access method for points and rectangles.InProcof ACM Management of Data(SIGMOD), pages 322331, 1990.

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 431440, 2002.

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 1629, 2012.

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

Y .-Y .Chen,T.Suel, and A. Markowetz.E_cient query processing geographic web search engines. In Proc.of ACM Management of Data(SIGMOD),pages277288, 2006

G .Cong, C. S .Jensen, and D. Wu. E_cient retrieval of the top-k most relevant spatial web objects. PVLDB, (1):337348, 2009.

C .Faloutsos and S .Christodoulakis Signature_les:An access method for docu-6mentsand its analytical performance evaluation. ACM Trans-actions on Information Systems (TOIS),2(4):267288, 1984.

I.D .Felipe, V.Hristidis, and N.Rishe. Keyword search on spatial databases.In Proc.of International Conference on Data Engineering(ICDE) pages 656665, 2008

R. Hariharan,B. Hore, C. Li, and S.Mehrotra.Processing spatial keyword(SK) in geographic information retrieval (GIR) systems. In Proc. of Scienti_c and Statistical Database Management (SSDBM), 2007. [11] X. Cao, G. Cong, C. S. Jensen, and B. C. Ooi.Collective spatial keyword quer-ying.In Proc. of ACM Management of Data (SIGMOD),pages 373384, 2011.

I.Kamel and C.Faloutsos. Hilbert R-tree : An improved r-tree using fractals. In Proc. of Very Large Data Bases(VLDB), pages 500509, 1994.

B .Chazelle, J .Kilian, R .Rubinfeld, and A.Tal. The bloomier _lter:ane_cient data structure for static support lookup tables. In Proc.of the Annual ACMSIAM Symposium on Discrete Algorithms (SODA),pages 3039, 2004.

Downloads

Published

2024-02-26

How to Cite

Anita R, P., Tabssum H, M., Rajashree B, P., & Shrimant B, B. (2024). Designing of Semantic Nearest Neighbor Searc. COMPUSOFT: An International Journal of Advanced Computer Technology, 4(02), 1509–1513. Retrieved from https://ijact.in/index.php/j/article/view/262

Issue

Section

Original Research Article

Similar Articles

<< < 1 2 3 4 5 6 7 > >> 

You may also start an advanced similarity search for this article.