arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.04703math.CTcs.DBcs.LO
收藏

用于技术计算的范畴化数据结构

Categorical Data Structures for Technical Computing

Evan Patterson, Owen Lynch, James Fairbanks

AI总结:

本文提出并实现了带属性的 C-集(acsets),统一推广图与数据框,并给出其在 Julia 中的高性能通用实现。

摘要:

许多数学对象可以表示为从有限展示范畴 $\mathsf{C}$ 到 $\mathsf{Set}$ 的函子。例如,图是从具有两条平行箭头的范畴到 $\mathsf{Set}$ 的函子。这类函子通常被称为 $\mathsf{C}$-集。在本文中,我们描述并实现了一种 $\mathsf{C}$-集的扩展,使其具有固定类型的数据属性,例如带有标记顶点的图或实值边权。我们将这类结构称为“acsets”,即“带属性的 $\mathsf{C}$-集”(attributed $\mathsf{C}$-sets)的缩写。acsets 源自先前关于代数数据库的工作,是图与数据框的联合推广。它们还涵盖了更复杂的类图对象,如布线图和带速率常数的 Petri 网。我们建立了 acsets 的数学理论,然后描述了在 Julia 编程语言中的通用实现,该实现利用高级语言特性达到了与专用数据结构相当的性能。

英文摘要:

Many mathematical objects can be represented as functors from finitely-presented categories $\mathsf{C}$ to $\mathsf{Set}$. For instance, graphs are functors to $\mathsf{Set}$ from the category with two parallel arrows. Such functors are known informally as $\mathsf{C}$-sets. In this paper, we describe and implement an extension of $\mathsf{C}$-sets having data attributes with fixed types, such as graphs with labeled vertices or real-valued edge weights. We call such structures "acsets," short for "attributed $\mathsf{C}$-sets." Derived from previous work on algebraic databases, acsets are a joint generalization of graphs and data frames. They also encompass more elaborate graph-like objects such as wiring diagrams and Petri nets with rate constants. We develop the mathematical theory of acsets and then describe a generic implementation in the Julia programming language, which uses advanced language features to achieve performance comparable with specialized data structures.

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

↑