Fast and Simple Relational Processing of Uncertain Data

dc.creatorAntova, Lyublena
dc.creatorJansen, Thomas
dc.creatorKoch, Christoph
dc.creatorOlteanu, Dan
dc.date2007-07-11
dc.date.accessioned2026-07-07T08:15:08Z
dc.date.available2026-07-07T08:15:08Z
dc.descriptionThis paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If we consider positive relational algebra extended by an operation for computing possible answers, a query on the logical level can be translated into, and evaluated as, a single relational algebra query on the U-relation representation. The translation scheme essentially preserves the size of the query in terms of number of operations and, in particular, number of joins. Standard techniques employed in off-the-shelf relational database management systems are effective for optimizing and processing queries on U-relations. In our experiments we show that query evaluation on U-relations scales to large amounts of data with high degrees of uncertainty.
dc.description12 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/0707.1644
dc.identifierhttp://arxiv.org/abs/0707.1644
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133360
dc.subjectDatabases
dc.subjectPerformance
dc.subjectH.2.1; H.2.4
dc.titleFast and Simple Relational Processing of Uncertain Data
dc.typetext

Files

Collections