Departmental Papers (CIS)

Document Type

Book Chapter

Date of this Version

October 2006

Comments

Postprint version. Published in Lecture Notes in Computer Science, Volume 4254, Current Trends in Database Technology, EDBT 2006, pages 278-296.
Publisher URL: http://dx.doi.org/10.1007/11896548_24

Abstract

We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite domains and we introduce a new kind of result, algebraic completion, for studying less expressive models. By viewing probabilistic models as incompleteness models with additional probability information, we define completeness and closure under query languages of general probabilistic database models and we introduce a new such model, probabilistic c-tables, that is shown to be complete and closed under the relational algebra.

Share

COinS
 

Date Posted: 08 December 2006

This document has been peer reviewed.