抄録

◎余　　翔・徳山　豪・全　眞嬉（東北大）

We study the problem of ranking queries on uncertain big databases where objects are mutually exclusive. We utilize the top-k dominating query with x-Relation data model, and propose novel dominance criteria to return reliable top-k answers. Moreover, we present pruning rules to reduce the computation. The experiments show that our ranking method is more reliable than the uncertain top-k query method. The runtime and space are also theoretically promising.