迈向声明式可比性：在函数依赖中的应用
Towards declarative comparabilities: application to functional dependencies
AI总结：
针对数据质量低下导致数据库相等性测试困难的问题，提出了基于格的声明式框架以在抽象层面指定相等性语义，并将其扩展至函数依赖研究，定义了抽象FDs及可能/确定FDs并给出复杂性结果。
摘要：
在现实生活中，由于不确定性、测量错误、缺失值或错误输入等原因，数据往往质量低下。这一问题阻碍了每个数据库管理系统中一项隐含却关键的操作：相等性测试。事实上，相等性最终是一种依赖于上下文的操作，具有大量不同的解释。在实践中，对不同类型相等性的处理留给了程序员，他们必须在代码中费力应对这些解释。我们提出了一个新的基于格的声明式框架来解决此问题。它允许在高度抽象的层面上为相等性指定多种语义。为了超越元组相等性，我们结合该框架研究了函数依赖（FDs）。首先，我们定义了抽象 FDs，对经典 FDs 进行了推广。这引发了对相等性特定解释的考量：现实（realities）。基于现实以及可能/确定答案，我们引入了可能/确定 FDs，并给出了一些相关的复杂性结果。
英文摘要：
In real life, data are often of poor quality as a result, for instance, of uncertainty, mismeasurements, missing values or bad inputs. This issue hampers an implicit yet crucial operation of every database management system: equality testing. Indeed, equality is, in the end, a context-dependent operation with a plethora of interpretations. In practice, the treatment of different types of equality is left to programmers, who have to struggle with those interpretations in their code. We propose a new lattice-based declarative framework to address this problem. It allows specification of numerous semantics for equality at a high level of abstraction. To go beyond tuple equality, we study functional dependencies (FDs) in the light of our framework. First, we define abstract FDs, generalizing classical FDs. These lead to the consideration of particular interpretations of equality: realities. Building upon realities and possible/certain answers, we introduce possible/certain FDs and give some related complexity results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
