An Improved Query Ranking and Hardness prediction Algorithm for Query Interfaces on Databases Jayasundar S1, Rajavarman V N2, Raja V Saishanmuga3 1Research Scholar, Dr. M.G.R Educational and Research Institute University, Chennai 2Professor, Dr. M.G.R Educational and Research Institute University, Chennai 3Assistant Professor, Shanmuganathan Engineering College, Pudukottai Online published on 24 October, 2017. Abstract The ability to make accurate predictions of the outcome of an event or a process ishighly desirable in several contexts of human activity. Keyword queries on databases give simple access to information, yet frequently experience the ill effects of low positioning quality, i.e., low accuracy and additionally review, as appeared in late benchmarks. It is valuable to recognize queries that are probably going to have low positioning quality to enhance the client fulfillment. The existing work has not focused about the semantic significance among the queries that are presented by the clients, which will prompt erroneous outcome recovery. To overcome this issue in the proposed work, we devise efficient algorithms to compute the degree of difficulty using query-time, and show that the overhead is very small compared to the query execution time by utilizing the Word Net tool. This will prompt an exact to k recovery of record because of utilization of semantic significance of the archives in web index. Our approach has shown a great improvement in accuracy of predicting hard keyword queries. Top Keywords Query Ranking, Databases, Hardness prediction Algorithm, Query Retrieval Prediction Algorithms. Top |