关键词: Top-k查询, 控制关系分析（DRA）, 不确定数据, 可能世界模型

Abstract: The dimensions of probability make it very difficult to process Top-k queries on uncertain data accurately and efficiently. On the basis of the existing methods, this paper proposes a Top-k queries method on uncertain data based on dominate relationship analysis (DRA). The method extracts the tuples most likely to become Top-k result through the use of dominate relations among the tuples, greatly reducing the amount of data in query processing. When the database is updated, the method can determine whether this update affects the results obtained before. If the results need not be changed, the method can avoid unnecessary cost of query reprocessing.

Key words: Top-k query, dominate relationship analysis (DRA), uncertain data, possible world model