.png){kind=icon}
.png){kind=icon}
Return
Possibilistic SQL Constraints
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-08623-5_14.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We equip SQL with reasoning capabilities about the entity integrity of data that may feature volume, variety, and veracity dimensions. We outline applications, and establish axiomatic, algorithmic, and logical characterizations of the PTIME-complete implication problem associated with possibilistic keys, FDs, and NOT NULL constraints. We introduce a tool that creates perfect samples and offers computational support for data stewards in identifying constraints that govern entity integrity in their domain of interest.
Keywords:
Functional dependency
Implication
Key
Missing data
Reasoning
SQL
Uncertainty
Journal
C
IF:
0
Papers:
21
Citations:
0