A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
We describe how aggregation is handled in the Trio system for uncertain and probabilistic data. Because "exact" aggregation in uncertain databases can produce exponentially-sized results, we provide three alternatives: a low bound on the aggregate value, a high bound on the value, and the expected value. These variants return a single result instead of a set of possible results, and they are generally efficient to compute for both full-table and grouped aggregation queries. We provide formaldoi:10.1109/tkde.2010.166 fatcat:yiuoz4e3g5hdnmb2d2axic4sim