Personal tools
You are here: Home Events Abstract Archives 2006-2007 Models for Incomplete and Probabilistic Information

Models for Incomplete and Probabilistic Information

Val Tannen University of Pennsylvania 4pm Wednesday, 8th March 2006 Room 202, Appleton Tower, King's Buildings

We discuss 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.

Joint work with T.J. Green, University of Pensylvania

Document Actions