Scholarlink

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.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Possibilistic SQL Constraints

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Ilya Litvinenko,
  • Philipp Skavantzos,
  • Henning Koehler,
  • Sebastian Link

摘要

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.