Efficient Query Service Provider using Clustering K-Nearest Neighborhood Algorithm

International Journal of Computer Trends and Technology (IJCTT)          
© 2016 by IJCTT Journal
Volume-36 Number-4
Year of Publication : 2016
Authors : A.Roslin Deepa, Dr. Ramalingam Sugumar


A.Roslin Deepa, Dr. Ramalingam Sugumar "Efficient Query Service Provider using Clustering K-Nearest Neighborhood Algorithm". International Journal of Computer Trends and Technology (IJCTT) V36(4):176-182 June 2016. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
Data mining has wide variety of real time application in many fields such as financial, telecommunication, biological, and among government agencies. So the query processing system is also an important thing to access and search the database. Once the KNN query service is outsourced, data confidentiality and query privacy become the important issues, because the data owner loses the control over the data. This type of queries are very useful in many applications namely decision making, data mining and pattern recognition. In this paper we studies a KNN based search which was worked on very efficiently. This method utilize a conventional data-partitioning index on the dataset, employ the state-of-the-art database techniques including k nearest neighbor (KNN) retrieval and reverse KNN search technique using Clustering find the minimum value and calculate the average using k-means algorithm. The empirical study of this paper is also providing the efficiency of the KNN based query processing on spatial databases.

1) Ali Khoshgozaran, Houtan Shirani-Mehr et al., “Blind evaluation of location based queries using space transformation to preserve location privacy”, Geoinformatica (2013) , DOI 10.1007/s10707-012-0172-9, pp. 599-634.
2) R. Bayardo and R. Agrawal, “Data Privacy through Optimal K-Anonymization,” Proc. 21st IEEE Int‟l Conf. Data Eng. (ICDE ‟00), 2005, pp. 217-228.
3) Chang-Sup Park and Sungchae Lim, “Effective keyword query processing with an extended answer structure in large graph databases”, International Journal of Web Information Systems, Vol. 10 Issn 1 pp. 65-84.
4) C.-Y.Chow, M.F.Mokbel, and X.Liu, “A Peer-to-Peer Spatial Cloaking Algorithm for Anonymous Location-Based Services”, Proc 14th ACM Int‟l Symp. Advances in Geographic Information Systems (ACM-GIS ‟06), pp. 171- 178, 2006.
5) Gao Cong Christian and S. Jensen et al., “Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects”, Copyright 2009 VLDB Endowment, ACM 0000000000000/00, VLDB „09, August 2428, 2009, Lyon, France, pp. 337-348.
6) G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis, “Fast Data Anonymization with Low Information Loss,” Proc. 33rd Int‟l Conf. Very Large Data Bases (VLDB ‟07), 2007.
7) Kim.H., Park.C.-S. and Lee.Y.J. (2011), “Improving keyword match for semantic search”, IEICE Trans. Inf. & Syst., Vol. E94-D No. 2, pp. 375-378.
8) Panos Kalnis and Gabriel Ghinita et al., “Preventing Location-Based Identity Inference in Anonymous Spatial Queries”, IEEE Transactions on Knowledge and Data Engineering, Vol. 19, No. 12, December 2007, pp. 1719- 1733.
9) Qin, Yu, J.X. and Chang.L. (2009), “Keyword search in databases: the power of RDBMS”, 2009 ACM SIGMOD Int. Conf. on Management of Data, pp. 681-694.
10) Yu, J.X., Qin.L. and Chang.L. (2010), “Keyword search in relational databases: a survey”, IEEE Data Engineering Bulletin, Vol. 33 No. 1, pp. 67-78.

Data mining, K-Nearest Neighborhood, Query processing, Range Query, Spatial Data base.