Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds

Incomplete and probabilistic database techniques are principled methods for coping with uncertainty in data. Unfortunately, the class of queries that can be answered efficiently over such databases is severely limited, even when advanced approximation techniques are employed. We introduce attribute annotated uncertain databases (AU-D Bs), an uncertain data model that annotates tuples and attribute values with bounds to compactly approximate an incomplete database. AU-D Bs are closed under relational algebra with aggregation using an efficient evaluation semantics. Using optimizations that trade accuracy for performance, our approach scales to complex queries and large datasets, and produces accurate results.