Ranking with Uncertain Scores

Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranking records with uncertain attributes needs to handle new problems that are fundamentally different from conventional ranking. Specifically, uncertainty in records' scores induces a partial order over records, as opposed to the total order that is assumed in the conventional ranking settings. In this paper, we present a new probabilistic model, based on partial orders, to encapsulate the space of possible rankings originating from score uncertainty. Under this model, we formulate several ranking query types with different semantics. We describe and analyze a set of efficient query evaluation algorithms. We show that our techniques can be used to solve the problem of rank aggregation in partial orders. In addition, we design novel sampling techniques to compute approximate query answers. Our experimental e...

• Type: Conference
• Year: 2009
• Where: ICDE
• Authors: Mohamed A. Soliman, Ihab F. Ilyas
• Keywords: Approximate Query Answers, Conventional Ranking Settings, Database, Efficient Query Evaluation, ICDE 2009, Partial Orders, Ranking Query Types