An Efficient Query Search using Cluster Based Approach in Data Mining

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2015 by IJETT Journal
Volume-30 Number-3
Year of Publication : 2015
Authors : Potnuru Santosh, Mula.Sudhakar

Citation 

Potnuru Santosh, Mula.Sudhakar"An Efficient Query Search using Cluster Based Approach in Data Mining", International Journal of Engineering Trends and Technology (IJETT), V30(3),147-150 December 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
To the best of our knowledge, there has not been any work on predicting or analyzing the difficulties of queries over databases. Researchers have proposed some methods to detect difficult queries over plain text document collections. However, these techniques are not applicable to our problem since they ignore the structure of the database. In particular, as mentioned earlier, a Keyword query interface must assign each query term to a schema element in the database. It must also distinguish the desired result type. We empirically show that direct adaptations of these techniques are ineffective for structured data. In this paper we are propose topic based cluster search algorithm for search of keyword in the database. By implementing this technique we can improve more efficiency of query oriented keyword search.

 References

[1]. V. Hristidis, L. Gravano, and Y Papakonstantinou, “Efficient IRstyle keyword search over relational databases,” in Proc. 29th VLDB Conf., Berlin, Germany, 2003, pp. 850–861.
[2]. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan, “Keyword searching and browsing in databases using BANKS,” in Proc. 18th ICDE, San Jose, CA, USA, 2002, pp. 431–440.
[3]. S. C. Townsend, Y. Zhou, and B. Croft, “Predicting query performance,” in Proc. SIGIR ’02, Tampere, Finland, pp. 299– 306.
[4]. Y. Zhou and B. Croft, “Ranking robustness: A novel framework to predict query performance,” in Proc. 15th ACM Int. CIKM, Geneva, Switzerland, 2006, pp. 567–574.
[5]. Y. Zhou and W. B. Croft, “Query performance prediction in web search environments,” in Proc. 30th Annu. Int. ACM SIGIR, New York, NY, USA, 2007, pp. 543–550.
[6]. B. He and I. Ounis, “Query performance prediction,” Inf. Syst., vol. 31, no. 7, pp. 585–594, Nov. 2006.
[7]. Y. Zhao, F. Scholer, and Y. Tsegay, “Effective pre-retrieval query performance prediction using similarity and variability evidence,” in Proc. 30th ECIR, Berlin, Germany, 2008, pp. 52– 64.
[8] C. Hauff, L. Azzopardi, and D. Hiemstra, “The combination and evaluation of query performance prediction methods,” in Proc. 31st ECIR, Toulouse, France, 2009, pp. 301–312.
[9]. S. C. Townsend, Y. Zhou, and B. Croft, “Predicting query performance,” in Proc. SIGIR ’02, Tampere, Finland, pp. 299– 306.
[10]. C. Hauff, V. Murdock, and R. Baeza-Yates, “Improved query difficulty prediction for the Web,” in Proc. 17th CIKM, Napa Valley, CA, USA, 2008, pp. 439–448.
[11]. Claudia Hauff,”Predicting The Effectiveness Of queries And Retrieval Systems”, January 29, 2010
[12]. A. Shtok, O. Kurland, and D. Carmel, “Predicting query performance by query-drift estimation,” in Proc. 2nd ICTIR, Heidelberg, Germany, 2009, pp. 305–312.

Keywords
Query performance, query effectiveness, keyword query, robustness, cosine similarity.