Query algebra operations for interval probabilities

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The groundswell for the '00s is imprecise probabilities. Whether the numbers represent the probable location of a GPS device at its next sounding, the inherent uncertainty of an individual expert's probability prediction, or the range of values derived from the fusion of sensor data, probability intervals became an important way of representing uncertainty. However, until recently, there has been no robust support for storage and management of imprecise probabilities. In this paper, we define the semantics of traditional query algebra operations of selection, projection, Cartesian product and join, as well as an operation of conditionalization, specific to probabilistic databases. We provide efficient methods for computing the results of these operations and show how they conform to probability theory. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Zhao, W., Dekhtyar, A., & Goldsmith, J. (2003). Query algebra operations for interval probabilities. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2736, 527–536. https://doi.org/10.1007/978-3-540-45227-0_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free