## Models for Incomplete and Probabilistic Information (2006)

### Cached

### Download Links

Venue: | IEEE Data Engineering Bulletin |

Citations: | 70 - 10 self |

### BibTeX

@ARTICLE{Green06modelsfor,

author = {Todd J. Green and Val Tannen},

title = {Models for Incomplete and Probabilistic Information},

journal = {IEEE Data Engineering Bulletin},

year = {2006},

volume = {29}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. 1

### Citations

3867 | Fuzzy sets - Zadeh - 1965 |

1629 |
Foundations of Databases
- Abiteboul, Hull, et al.
- 1995
(Show Context)
Citation Context ...ed under the relational algebra. 1 Introduction The representation of incomplete information in databases has been an important research topic for a long time, see the references in [18], in Ch.19 of =-=[2]-=-, in [31], in [35, 25], as well as the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries ... |

922 | Probability: theory and examples
- Durrett
- 1996
(Show Context)
Citation Context ...s remain true if D is finite; we just require an infinite supply of variables.sModels for Incomplete and Probabilistic Information 11 By finite probability space we mean a probability space (see e.g. =-=[11]-=-) (Ω, F, P[ ]) in which the set of outcomes Ω is finite and the σ-field of events F consists of all subsets of Ω. We shall use the equivalent formulation of pairs (Ω, p) where Ω is the finite set of o... |

476 | M.: Optimal implementation of conjunctive queries in relational data bases - Chandra, Merlin - 1977 |

376 | Efficient query evaluation on probabilistic databases
- Dalvi, Suciu
- 2006
(Show Context)
Citation Context ... )), the image space of Mod(T ) under q. 7 Probabilistic ?-Tables and Probabilistic Or-Set Tables Probabilistic ?-tables (p-?-tables for short) are commonly used for probabilistic models of databases =-=[34, 15, 16, 9]-=- (they are called “independent tuple representation in [30]). Such tables are the probabilistic counterpart of ?-tables where each “?” is replaced by a probability value. Example 6 below shows such a ... |

364 |
Incomplete Information in Relational Databases
- Imieliński, Lipski
- 1984
(Show Context)
Citation Context ...ted to recently active research topics such as inconsistent databases and repairs [4], answering queries using views [1], and data exchange [13]. The classic reference on incomplete databases remains =-=[20]-=- with the fundamental concept of c-table and its restrictions to simpler tables with variables. The most important result of [20] is the query answering algorithm that defines an algebra on c-tables t... |

339 | Why and Where: A Characterization of Data Provenance
- Buneman, Khanna, et al.
- 2001
(Show Context)
Citation Context ... the c-table algebra was in essence rediscovered in [15, 22, 34] and to some extent in [28]. The condition that decorates a tuple t in ¯q(T ) can be seen as the lineage [8], a.k.a. the why-provenance =-=[6]-=-, of the tuple t. We plan to discuss elsewhere the connection between algorithms for computing why-provenance and the c-table algebra. It would be interesting to connect this work to the extensive lit... |

339 | Data Exchange: Semantics and Query Answering
- Fagin, Kolaitis, et al.
- 2003
(Show Context)
Citation Context ...the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries using views [1], and data exchange =-=[13]-=-. The classic reference on incomplete databases remains [20] with the fundamental concept of c-table and its restrictions to simpler tables with variables. The most important result of [20] is the que... |

298 | Complexity of answering queries using materialized views
- ABITEBOUL, DUSCHKA
- 1998
(Show Context)
Citation Context ...n [35, 25], as well as the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries using views =-=[1]-=-, and data exchange [13]. The classic reference on incomplete databases remains [20] with the fundamental concept of c-table and its restrictions to simpler tables with variables. The most important r... |

262 | Uldbs: Databases with uncertainty and lineage - Benjelloun, Sarma, et al. - 2006 |

250 | Reasoning about Uncertainty - Halpern - 2003 |

235 | Trio: A System for Integrated Management of Data, Accuracy, and Lineage
- Widom
- 2005
(Show Context)
Citation Context ...he representation of incomplete information in databases has been an important research topic for a long time, see the references in [18], in Ch.19 of [2], in [31], in [35, 25], as well as the recent =-=[33, 30, 29]-=-. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries using views [1], and data exchange [13]. The classic refer... |

190 | A probabilistic relational algebra for the integration of information retrieval and database systems
- Fuhr, Rölleke
- 1997
(Show Context)
Citation Context ... probabilistic models of databases were studied less intensively than incompleteness models, with some notable exceptions [7, 5, 28, 23, 10]. Essential progress was made independently in three papers =-=[15, 22, 34]-=- that were published at about the same time. [15, 34] assume a model in which tuples are taken independently in a relation with given probabilities. [22] assumes a model with a separate distribution f... |

182 | ProbView: A flexible probabilistic database system
- Lakshmanan, Leone, et al.
- 1997
(Show Context)
Citation Context ... probabilistic models of databases were studied less intensively than incompleteness models, with some notable exceptions [7, 5, 28, 23, 10]. Essential progress was made independently in three papers =-=[15, 22, 34]-=- that were published at about the same time. [15, 34] assume a model in which tuples are taken independently in a relation with given probabilities. [22] assumes a model with a separate distribution f... |

152 |
Working models for uncertain data
- Sarma, Benjelloun, et al.
- 2006
(Show Context)
Citation Context ...he representation of incomplete information in databases has been an important research topic for a long time, see the references in [18], in Ch.19 of [2], in [31], in [35, 25], as well as the recent =-=[33, 30, 29]-=-. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries using views [1], and data exchange [13]. The classic refer... |

144 | Tracing the lineage of view data in a warehousing environment
- Cui, Widom, et al.
(Show Context)
Citation Context ... but there is a good reason why the c-table algebra was in essence rediscovered in [15, 22, 34] and to some extent in [28]. The condition that decorates a tuple t in ¯q(T ) can be seen as the lineage =-=[8]-=-, a.k.a. the why-provenance [6], of the tuple t. We plan to discuss elsewhere the connection between algorithms for computing why-provenance and the c-table algebra. It would be interesting to connect... |

142 | Equivalences among relational expressions with the union and difference operators - Sagiv, Yannakakis - 1980 |

140 | Provenance semirings - Green, Karvounarakis, et al. - 2007 |

136 | An algebra for probabilistic databases
- Pittarelli
- 1994
(Show Context)
Citation Context ... is complete. We give a number of such algebraic completion results. Early on, probabilistic models of databases were studied less intensively than incompleteness models, with some notable exceptions =-=[7, 5, 28, 23, 10]-=-. Essential progress was made independently in three papers [15, 22, 34] that were published at about the same time. [15, 34] assume a model in which tuples are taken independently in a relation with ... |

126 | On the representation and querying of sets of possible worlds
- Abiteboul, Kanellakis, et al.
- 1991
(Show Context)
Citation Context ...em. We did not consider c-tables with global conditions [17] nor did we describe the exact connection to logical databases [27, 32]. Even more importantly, we did not consider complexity issues as in =-=[3]-=-. All of the above are important topics for further work, especially the complexity issues and the related issues of succinctness/compactness of the table representations. As we see, in pc-tables the ... |

96 |
A probabilistic relational model and algebra
- DEY, SARKAR
- 1996
(Show Context)
Citation Context ... is complete. We give a number of such algebraic completion results. Early on, probabilistic models of databases were studied less intensively than incompleteness models, with some notable exceptions =-=[7, 5, 28, 23, 10]-=-. Essential progress was made independently in three papers [15, 22, 34] that were published at about the same time. [15, 34] assume a model in which tuples are taken independently in a relation with ... |

90 | Practical lineage tracing in data warehouses - Cui, Widom - 2000 |

78 | Algebraic Theory of Lattices - Crawley, Dilworth - 1973 |

72 | Fast and simple relational processing of uncertain data - Antova, Jansen, et al. - 2008 |

67 | Curated databases - Buneman, Cheney, et al. - 2008 |

63 | Probabilistic deductive databases - LAKSHMANAN, SADRI - 1994 |

59 | Update exchange with mappings and provenance - Green, Karvounarakis, et al. - 2007 |

57 |
The Problem of Incomplete Information in Relational Databases
- Grahne
- 1989
(Show Context)
Citation Context ... complete and closed under the relational algebra. 1 Introduction The representation of incomplete information in databases has been an important research topic for a long time, see the references in =-=[18]-=-, in Ch.19 of [2], in [31], in [35, 25], as well as the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], a... |

53 |
der Meyden. Logical Approaches to Incomplete Information: A Survey
- van
- 1998
(Show Context)
Citation Context ... the relational algebra. 1 Introduction The representation of incomplete information in databases has been an important research topic for a long time, see the references in [18], in Ch.19 of [2], in =-=[31]-=-, in [35, 25], as well as the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries using vie... |

52 | Debugging Schema Mappings with Routes - Chiticariu, Tan |

46 | The complexity of query reliability - Grädel, Gurevich, et al. - 1998 |

45 | Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming
- Arenas, Bertossi, et al.
(Show Context)
Citation Context ...n [18], in Ch.19 of [2], in [31], in [35, 25], as well as the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs =-=[4]-=-, answering queries using views [1], and data exchange [13]. The classic reference on incomplete databases remains [20] with the fundamental concept of c-table and its restrictions to simpler tables w... |

40 |
Incomplete Objects - A Data Model for Design and Planning Applications
- Imieliński, Naqvi, et al.
- 1991
(Show Context)
Citation Context ...ater. A ?-table is a conventional instance in which tuples are optionally labeled with “?,” meaning that the tuple may be missing. An or-set-table looks like a conventional instance but or-set values =-=[21, 26]-=- are allowed. An or-set value 〈1, 2, 3〉 signifies that exactly one of 1, 2, or 3 is the “actual” (but unknown) value. Clearly, the two ideas can be combined yielding another representation systems tha... |

40 |
A sound and sometimes complete query evaluation algorithm for relational databases with null values
- REITER
- 1986
(Show Context)
Citation Context ...ARQs4 Todd J. Green and Val Tannen The notation corresponds to the fact that T can be seen as a logical assertion such that the conventional instances in Mod(T ) are in fact the models of T (see also =-=[27, 32]-=-). The classical reference [20] considers three representation systems: Codd tables, v-tables, and c-tables. v-tables are conventional instances in which variables can appear in addition to constants ... |

38 |
Querying logical databases
- Vardi
- 1985
(Show Context)
Citation Context ...ARQs4 Todd J. Green and Val Tannen The notation corresponds to the fact that T can be seen as a logical assertion such that the conventional instances in Mod(T ) are in fact the models of T (see also =-=[27, 32]-=-). The classical reference [20] considers three representation systems: Codd tables, v-tables, and c-tables. v-tables are conventional instances in which variables can appear in addition to constants ... |

36 | L.: Semantic representations and query languages for Or-sets
- Libkin, Wong
- 1996
(Show Context)
Citation Context ...ater. A ?-table is a conventional instance in which tuples are optionally labeled with “?,” meaning that the tuple may be missing. An or-set-table looks like a conventional instance but or-set values =-=[21, 26]-=- are allowed. An or-set value 〈1, 2, 3〉 signifies that exactly one of 1, 2, or 3 is the “actual” (but unknown) value. Clearly, the two ideas can be combined yielding another representation systems tha... |

33 |
A probabilistic relational data model
- Barbará, Garcia-Molina, et al.
(Show Context)
Citation Context ... is complete. We give a number of such algebraic completion results. Early on, probabilistic models of databases were studied less intensively than incompleteness models, with some notable exceptions =-=[7, 5, 28, 23, 10]-=-. Essential progress was made independently in three papers [15, 22, 34] that were published at about the same time. [15, 34] assume a model in which tuples are taken independently in a relation with ... |

28 | Containment of conjunctive queries: beyond relations as sets - Ioannidis, Ramakrishnan - 1995 |

26 | Probabilistic object bases
- Eiter, Lu, et al.
- 2001
(Show Context)
Citation Context ...e and the c-table algebra. It would be interesting to connect this work to the extensive literature on disjunctive databases, see e.g., [24], and to the work on probabilistic objectoriented databases =-=[12]-=-. Probabilistic modeling is by no means the only way to model uncertainty in information systems. In particular it would be interesting to investigate possibilistic models [19] for databases, perhaps ... |

23 | Aspects of Partial Information in Databases
- Libkin
- 1910
(Show Context)
Citation Context ...tional algebra. 1 Introduction The representation of incomplete information in databases has been an important research topic for a long time, see the references in [18], in Ch.19 of [2], in [31], in =-=[35, 25]-=-, as well as the recent [33, 30, 29]. Moreover, this work is closely related to recently active research topics such as inconsistent databases and repairs [4], answering queries using views [1], and d... |

22 |
Modeling uncertainty in databases
- Sadri
- 1991
(Show Context)
Citation Context |

20 | Learning probabilistic relational models with structural uncertainty
- Getoor, Koller, et al.
(Show Context)
Citation Context ...formation 15 pc-tables even more flexible, we plan to investigate models in which the assumption that the variables take values independently is relaxed by using conditional probability distributions =-=[14]-=-. Space limitations prevent us from giving details, but there is a good reason why the c-table algebra was in essence rediscovered in [15, 22, 34] and to some extent in [28]. The condition that decora... |

15 |
Tables - An Efficient Tool for Handling Incomplete Information in Databases
- Horn
- 1989
(Show Context)
Citation Context ...e is minimal in the sense that closing the representation system under a more restricted fragment does not obtain a complete representation system. We did not consider c-tables with global conditions =-=[17]-=- nor did we describe the exact connection to logical databases [27, 32]. Even more importantly, we did not consider complexity issues as in [3]. All of the above are important topics for further work,... |

11 | and A Pirotte. Imperfect information in relational databases - Zimanyi - 1997 |

5 | Optimal Models of Disjunctive Logic Programs
- Leone, Scarcello, et al.
- 2001
(Show Context)
Citation Context ...re the connection between algorithms for computing why-provenance and the c-table algebra. It would be interesting to connect this work to the extensive literature on disjunctive databases, see e.g., =-=[24]-=-, and to the work on probabilistic objectoriented databases [12]. Probabilistic modeling is by no means the only way to model uncertainty in information systems. In particular it would be interesting ... |

5 |
Query evaluation in probabilistic databases
- Zimányi
- 1997
(Show Context)
Citation Context ... probabilistic models of databases were studied less intensively than incompleteness models, with some notable exceptions [7, 5, 28, 23, 10]. Essential progress was made independently in three papers =-=[15, 22, 34]-=- that were published at about the same time. [15, 34] assume a model in which tuples are taken independently in a relation with given probabilities. [22] assumes a model with a separate distribution f... |

2 |
Foundations of probabilistic answers to queries (tutorial
- Suciu, Dalvi
- 2005
(Show Context)
Citation Context ...Probabilistic Or-Set Tables Probabilistic ?-tables (p-?-tables for short) are commonly used for probabilistic models of databases [34, 15, 16, 9] (they are called “independent tuple representation in =-=[30]-=-). Such tables are the probabilistic counterpart of ?-tables where each “?” is replaced by a probability value. Example 6 below shows such a table. The tuples not explicitly shown are assumed tagged w... |