A efficient algorithm for Top-K queries on uncertain data streams
Yinju Lu · Electronic Design Engineering · 2013
Top-K queries have always been a significant technique in the management of uncertain data streams.Based on the prevailing uncertain data model and possible world semantic model,in this paper,an uncertain model and its query semantics are defined.An algorithm for Top-K queries on uncertain data streams is designed and realized,which return k queries having maximum rank scores.Rank score of a query result is well-defined,depending on its possibility under the possible world.The extensive experiments demonstrate that compared to CSQ and SCSQ,this algorithm is more practical and efficient.