Cluster Based Prediction of Keyword Query Over Databases

Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 5)

Abstract

In this paper, We using the cluster-based prediction, to predict the keywords over database in a efficient way. By using the cluster-based prediction, efficiency of searching query is improved and time complexity is reduced. İn this paper, we proposed Text preprocessing, MVS matrix, k-means clustering and character shuffle preprocessing searching algorithm in order to improve efficiency. In text preprocessing, we eliminates all the tags and find the relative frequencies of each document then weights is calculated. By using MVS matrix, similarities of each document is calculated then formed into matrix. Based on similarities, Clusters are formed by using K-means clustering, then the keyword is searched in clustered instead of several documents. Then the searching is performed in efficient way.

Keywords

Text preprocessing MVS matrix Keyword 

References

  1. 1.
    V. Hristidis, L. Gravano, and Y. Papakonstantinou, “Efficient IR style keyword search over relational databases,” in Proc. 29 th VLDB Conf., Berlin, Germany, 2003, pp. 850–861.Google Scholar
  2. 2.
    Y. Luo, X. Lin, W. Wang, and X. Zhou, “SPARK: Top-k keyword query in relational databases,” in Proc. 2007 ACM SIGMOD, Beijing, China, pp. 115–126.Google Scholar
  3. 3.
    V. Ganti, Y. He, and D. Xin, “Keyword++: A framework to improve keyword search over entity databases,” in Proc. VLDB Endowment, Singapore, Sept. 2010, vol. 3, no. 1–2, pp. 711–722.Google Scholar
  4. 4.
    J. Kim, X. Xue, and B. Croft, “A probabilistic retrieval model for semi structured data,” in Proc. ECIR, Tolouse, France, 2009, pp. 228–239.Google Scholar
  5. 5.
    N. Sarkas, S. Paparizos, and P. Tsaparas, “Structured annotations of web queries,” in Proc. 2010 ACM SIGMOD Int. Conf. Manage. Data, Indianapolis, IN, USA, pp. 771–782.Google Scholar
  6. 6.
    O. Kurland, A. Shtok, D. Carmel, and S. Hummel, “A Unified framework for post-retrieval query-performance prediction,” in Proc. 3rd Int. ICTIR, Bertinoro, Italy, 2011, pp. 15–26.Google Scholar
  7. 7.
    S. Cheng, A. Termehchy, and V. Hristidis, “Predicting the effectiveness of keyword queries on databases,” in Proc. 21st ACM Int. CIKM, Maui, HI, 2012, pp. 1213–1222.Google Scholar
  8. 8.
    O. Kurland, A. Shtok, S. Hummel, F. Raiber, D. Carmel, and O. Rom, “Back to the roots: A probabilistic framework for query performance prediction,” in Proc. 21st Int. CIKM, Maui, HI, USA, 2012, pp. 823–832.Google Scholar
  9. 9.
    K. Collins-Thompson and P. N. Bennett, “Predicting query performance via classification,” in Proc. 32nd ECIR, Milton Keynes, U.K., 2010, pp. 140–152.Google Scholar
  10. 10.
    A. Shtok, O. Kurland, and D. Carmel, “Predicting query performance by query-drift estimation,” in Proc. 2nd ICTIR, Heidelberg, Germany, 2009, pp. 305–312.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  1. 1.Department of CSEANIL Neerukonda Institute of Technology and Sciences (ANITS)VisakhapatnamIndia
  2. 2.GVP college for degree & Pg coursesVisakhapatnamIndia

Personalised recommendations