master
Oliver Kennedy 2016-10-20 16:14:06 -04:00
parent 3d7ce944dd
commit ffe32cf549
1 changed files with 2 additions and 1 deletions

@ -21,7 +21,8 @@ A solid, theory-focused survey of techniques for probabilistic databases. A goo
The C-Tables data representation is a way to compactly encode row- and attribute-level uncertainty in a classical deterministic database. The idea is to allow the use of labeled nulls, and to tag each row in an uncertain relation with a so-called 'local condition' The local condition is a boolean formula who's atoms are comparisons over the labeled nulls. Every possible assignment of values to the local nulls defines a possible world; Rows are only part of possible worlds who's valuation causes the row's local condition to evaluate to true.
* [On representing incomplete information in a relational data base](http://dl.acm.org/citation.cfm?id=1286869)
* [On representing incomplete information in a relational data base](http://dl.acm.org/citation.cfm?id=1286869) (no longer available on the internet?)
* [Incomplete Information in Relational Databases](http://dl.acm.org/citation.cfm?id=1886) (JACM article)
#### Three-Valued Logic