Name
Abstract | ||
|---|---|---|
Probabilistic databases accommodate well the requirements of modern applications that produce large volumes of uncertain data from a variety of sources. We propose an expressive class of probabilistic cardinality constraints which empowers users to specify lower and upper bounds on the marginal probabilities by which cardinality constraints should hold in a data set of acceptable quality. The bounds help organizations balance the consistency and completeness targets for their data quality, and provide probabilities on the number of query answers without querying the data. Algorithms are established for an agile schema-driven acquisition of the right lower and upper bounds in a given application domain, and for reasoning about the constraints. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-69904-2_21 | CONCEPTUAL MODELING, ER 2017 |
Keywords | Field | DocType |
Cardinality constraint, Data and knowledge intelligence, Decision support, Probability, Requirements engineering, Summaries | Data mining,Data quality,Computer science,Decision support system,Requirements engineering,Cardinality,Uncertain data,Application domain,Probabilistic logic,Completeness (statistics) | Conference |
Volume | ISSN | Citations |
10650 | 0302-9743 | 1 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tania K. Roblot | 1 | 8 | 2.29 |
| Sebastian Link | 2 | 185 | 12.50 |