Reading PAGE
Peer Evaluation activity
| Trusted by | 1 |
| Views | 6 |
Total impact ?
Send a 
Todd has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
This was brought to you by:
Chapter 2 MODELS FOR INCOMPLETE AND PROBABILISTIC INFORMATION
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Description
Title : Chapter 2 MODELS FOR INCOMPLETE AND PROBABILISTIC INFORMATION
Area : Computer Science
Language : English
Url : http://www.cs.ucdavis.edu/~green/papers/models-chapter.pdf
Doi : 10.1.1.162.2806
Abstract : Keywords: 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. We also identify fundamental connections between query answering with incomplete and probabilistic databases and data provenance. We show that the calculations for incomplete databases, probabilistic databases, bag semantics, lineage, and why-provenance are particular cases of the same general algorithms involving semi-rings. This further suggests a comprehensive provenance representation that uses semi-rings of polynomials. Finally, we show that for positive Boolean c-tables, containment of positive relational queries is the same as for standard set semantics. Incomplete databases, probabilistic databases, provenance, lineage, semi-rings 1.
Subject : unspecifiedArea : Computer Science
Language : English
| Affiliations : |
Doi : 10.1.1.162.2806
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Todd's Peer Evaluation activity
| Trusted by | 1 |
- FPeer Evaluation, Publisher, Peer Evaluation.
| Views | 6 |
- 2Containment of Conjunctive Queries on Annotated Relations
- 1Chapter 2 MODELS FOR INCOMPLETE AND PROBABILISTIC INFORMATION
- 1SPECIAL ISSUE PAPER Implementing mapping composition
- 1The ORCHESTRA collaborative data sharing system
- 1To ElisabethABSTRACT COLLABORATIVE DATA SHARING WITH MAPPINGS AND PROVENANCE
Todd has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available
Your email