Name
Abstract | ||
|---|---|---|
Together with domain and entity integrity, referential integrity embodies the integrity principles of information systems. While relational databases address applications for data that is certain, modern applications require the handling of uncertain data. In particular, the veracity of big data and the complex integration of data from heterogeneous sources leave referential integrity vulnerable. We apply possibility theory to introduce the class of possibilistic inclusion dependencies. We show that our class inherits good computational properties from relational inclusion dependencies. In particular, we showthat the associated implication problem is PSPACE-complete, but fixed-parameter tractable in the input arity. Combined with possibilistic keys and functional dependencies, our framework makes it possible to quantify the degree of trust in entities and relationships. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-79382-1_16 | ADVANCED INFORMATION SYSTEMS ENGINEERING (CAISE 2021) |
Keywords | DocType | Volume |
Computational complexity, Inclusion dependency, Possibility theory, Reasoning, Referential integrity | Conference | 12751 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Link | 1 | 462 | 39.59 |
| Ziheng Wei | 2 | 8 | 6.92 |