Efﬁcient Prediction of Difﬁcult Keyword Queries over Databases
|Name||Efﬁcient Prediction of Difﬁcult Keyword Queries over Databases|
keyword query is very easy and simple to access database but again the problem of low precise come for that hard query is required. Here we providing the novel framework to measure the degree of difficulty for a keyword query over a database, considering both the structure and the content of the database and the query results.We evaluate our query difficulty prediction model against two effectiveness benchmarks for popular keyword search ranking methods. Our empirical results show that our model predicts the hard queries with high accuracy. Further, we present a suite of optimizations to minimize the incurred time overhead.
|ieee paper year||2015|