使用Chase的快速左Kan扩展
Fast Left Kan Extensions Using The Chase
摘要:
我们展示了如何计算左Kan扩展可以减少到计算的自由模型carnival(有限极限)理论。我们讨论了如何标准和并行追逐计算弱自由模型的正规理论和自由模型的Carnival理论,并比较了“自由模型”的概念与类似的概念,从数据库理论称为“通用模型”。我们证明了,作为计算有限自由模型的Carnival理论的算法,标准和并行追逐是公平的假设下完成。最后,我们描述了一个优化的实现的并行追逐专用于左Kan扩展,实现了一个数量级的改善,在我们的性能基准相比,下一个最快的左Kan扩展算法,我们知道。
英文摘要:
We show how computation of left Kan extensions can be reduced to computation of free models of cartesian (finite-limit) theories. We discuss how the standard and parallel chase compute weakly free models of regular theories and free models of cartesian theories, and compare the concept of "free model" with a similar concept from database theory known as "universal model". We prove that, as algorithms for computing finite free models of cartesian theories, the standard and parallel chase are complete under fairness assumptions. Finally, we describe an optimized implementation of the parallel chase specialized to left Kan extensions that achieves an order of magnitude improvement in our performance benchmarks compared to the next fastest left Kan extension algorithm we are aware of.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。