arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.23485cs.DB
收藏

论在MatBase中强制实施可满足、一致且最小的二元关系约束集

On Enforcing Satisfiable, Coherent, and Minimal Sets of Dyadic Relation Constraints in MatBase

Christian Mancas

AI总结:

本文在(初等)数学数据模型((E)MDM)语境下定义了二元关系约束的核心数学概念及推论,提出MatBase原型系统的伪代码算法以强制实施约束集,证明其可保证约束集的可满足性、一致性和最小性等特性,并展示了相关界面与元目录表。

摘要:

本文在我们的(初等)数学数据模型((E)MDM)语境下,严格且简洁地定义了二元关系、自反性、反自反性、对称性、反对称性、传递性、反传递性、欧几里得性、反欧几里得性、等价性、无环性、连通性等数学概念,以及它们之间的关联性质,还有将这些二元关系性质视为数据库约束时,其集合在一致性和最小性方面的相关推论。本文的主要贡献是MatBase所使用的伪代码算法,MatBase是我们基于(E)MDM、关系模型和实体-关系数据模型的智能数据库管理系统原型,该算法用于强制实施二元关系约束集。我们证明,该算法可保证此类约束集的可满足性、一致性和最小性,同时具有极高的速度、可靠性、完备性和简洁性。随后,我们还展示了MatBase的相关用户界面,以及该算法所使用的元目录表。

英文摘要:

This paper rigorously and concisely defines, in the context of our (Elementary) Mathematical Data Model ((E)MDM), the mathematical concepts of dyadic relation, reflexivity, irreflexivity, symmetry, asymmetry, transitivity, intransitivity, Euclideanity, inEuclideanity, equivalence, acyclicity, connectivity, the properties that relate them, and the corresponding corollaries on the coherence and minimality of sets made of such dyadic relation properties viewed as database constraints. Its main contribution is the pseudocode algorithm used by MatBase, our intelligent database management system prototype based on both (E)MDM, the relational, and the entity-relationship data models, for enforcing dyadic relation constraint sets. We proved that this algorithm guarantees the satisfiability, coherence, and minimality of such sets, while being very fast, solid, complete, and minimal. In the sequel, we also presented the relevant MatBase user interface as well as the tables of its metacatalog used by this algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑