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

分布约束:对分布式数据的追求

Distribution Constraints: The Chase for Distributed Data

Gaetano Geck, Frank Neven, Thomas Schwentick

摘要:

本文介绍了一个声明性的框架,以指定和原因分布的数据在计算节点在分布式设置。更具体地说,它提出了分布约束,这是元组和等式生成依赖关系(tgds和egds)扩展与节点变量范围内的计算节点。特别是,它们可以通过使用比较原子来表达共分区约束和基于范围的数据分布约束。主要的技术贡献是分布约束的蕴涵问题的研究。虽然蕴涵一般是不可判定的,但展示了所谓的数据满约束的相关片段,相应的蕴涵问题对于EXPTIME,PSPACE和NP是完全的。这些结果产生的界限决定并行正确的合取查询分布约束的存在。

英文摘要:

This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating dependencies (tgds and egds) extended with node variables ranging over computing nodes. In particular, they can express co-partitioning constraints and constraints about range-based data distributions by using comparison atoms. The main technical contribution is the study of the implication problem of distribution constraints. While implication is undecidable in general, relevant fragments of so-called data-full constraints are exhibited for which the corresponding implication problems are complete for EXPTIME, PSPACE and NP. These results yield bounds on deciding parallel-correctness for conjunctive queries in the presence of distribution constraints.

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

↑