## A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems (1994)

### Cached

### Download Links

- [ls6-www.informatik.uni-dortmund.de]
- [www.cs.cornell.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM Transactions on Information Systems |

Citations: | 189 - 31 self |

### BibTeX

@ARTICLE{Fuhr94aprobabilistic,

author = {Norbert Fuhr and Thomas Rölleke},

title = {A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems},

journal = {ACM Transactions on Information Systems},

year = {1994},

volume = {15},

pages = {32--66}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a probabilistic relational algebra (PRA) which is a generalization of standard relational algebra. Here tuples are assigned probabilistic weights giving the probability that a tuple belongs to a relation. Based on intensional semantics, the tuple weights of the result of a PRA expression always confirm to the underlying probabilistic model. We also show for which expressions extensional semantics yields the same results. Furthermore, we discuss complexity issues and indicate possibilities for optimization. With regard to databases, the approach allows for representing imprecise attribute values, whereas for information retrieval, probabilistic document indexing and probabilistic search term weighting can be modelled. As an important extension, we introduce the concept of vague predicates which yields a probabilistic weight instead of a Boolean value, thus allowing for queries with vague selection conditions. So PRA implements uncertainty and vagueness in combination with the...