秩感知数据库中序数变换的不变性
Invariance to ordinal transformations in rank-aware databases
摘要:
我们研究的顺序变换的查询结果在排名感知数据库中的影响,从分数的全序结构与infima作为聚合函数的排名关系得出他们的操作。我们介绍的概念,序数包含和等价的排名关系,并证明了基于infima的代数运算与排名关系是不变的序数变换:应用到原始和转换后的数据产生的结果是等价的分数给出的顺序,这意味着前k结果的查询保持不变。我们发现这个重要的属性是保留在替代查询系统的基础上开发的哥德尔逻辑的背景下的关系演算。我们评论单调查询评价的关系,并表明,结果可以达到替代排名意识的方法。
英文摘要:
We study influence of ordinal transformations on results of queries in rank-aware databases which derive their operations with ranked relations from totally ordered structures of scores with infima acting as aggregation functions. We introduce notions of ordinal containment and equivalence of ranked relations and prove that infima-based algebraic operations with ranked relations are invariant to ordinal transformations: Queries applied to original and transformed data yield results which are equivalent in terms of the order given by scores, meaning that top-k results of queries remain the same. We show this important property is preserved in alternative query systems based of relational calculi developed in context of Gödel logic. We comment on relationship to monotone query evaluation and show that the results can be attained in alternative rank-aware approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。