A Study on Cleaning of Keyword Query over Database
Shen Wenting · Computer Knowledge and Technology · 2011
At present,keyword query on databases has become a hot research field,and the direction has some very good results,such as BANKS,DBXplorer etc.These methods have their respective advantages and disadvantages,but actually all methods can be divided into two kinds,data graph based and schema graph based methods.These two methods are similar in core idea,and,assuming the length of a query sequence is n,then the time complexity of above two methods are both O(2n),namely the time complexity increase expo nentially.So without prejudice to the premise of for accuracy,if can reduce n,then the optimization of query time complexity has great sig nificance.In addition,keywords chosen directly influences the quality of the query,but,one hand,users can't knows exactly what key words should be chosen,,on the other hand,there probably exist certain spelling mistakes,so,keyword cleaning before the query can im prove the accuracy and time efficiency.