Efficient processing of top-k queries is a crucial requirement in many interactive
environments that involve massive amounts of data. In particular, efficient top-k processing …

Uncertainty accompanies our life processes and covers almost all fields of scientific studies.
Two general categories of uncertainty, namely, aleatory uncertainty and epistemic …

Top-k processing in uncertain databases is semantically and computationally different from
traditional top-k processing. The interplay between score and uncertainty makes traditional …

Trio is a new database system that manages not only data, but also the accuracy and
lineage of the data. Approximate (uncertain, probabilistic, incomplete, fuzzy, and imprecise!) …

In this paper, an introduction and survey over probabilistic information retrieval (IR) is given.
First, the basic concepts of this approach are described: the probability-ranking principle …

This paper introduces\uldb s, an extension of relational databases with simple yet
expressive constructs for representing and manipulating both {\em lineage} and {\em …

It is often desirable to represent in a database, entities whose properties cannot be
deterministically classified. The authors develop a data model that includes probabilities …

We present a probabilistic relational algebra (PRA) which is a generalization of standard
relational algebra. In PRA, tuples are assigned probabilistic weights giving the probability …

This paper explores an inherent tension in modeling and querying uncertain data: simple,
intuitive representations of uncertain data capture many application requirements, but these …

This article surveys probablistic approaches to modeling information retrieval. The basic
concepts of probabilistic approaches to information retrieval are outlined and the principles …