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

并集上的抽样

Sampling over Union of Joins

Yurong Liu, Yunlong Xu, Fatemeh Nargesian

摘要:

数据科学家经常利用多个关系数据源进行分析。学习和近似查询应答中的一个标准假设是,数据是底层分布的均匀且独立的样本。为了避免连接和联合的成本,给定一组连接,我们研究了从连接的联合中获得随机样本而不执行完全连接和联合的问题。我们提出了一个一般的框架,随机抽样的链,非循环和循环连接,样本均匀性和独立性的保证。我们研究了新的问题的联盟连接大小评估,并提出了两个近似方法的基础上直方图的列和随机游走的数据。我们提出了一个在线联合采样框架,该框架使用廉价的计算参数近似值进行建模,并在采样过程中实时改进。我们从TPC-H基准测试中评估了我们的工作负载框架,并探索了联合近似精度和采样效率之间的权衡。

英文摘要:

Data scientists often draw on multiple relational data sources for analysis. A standard assumption in learning and approximate query answering is that the data is a uniform and independent sample of the underlying distribution. To avoid the cost of join and union, given a set of joins, we study the problem of obtaining a random sample from the union of joins without performing the full join and union. We present a general framework for random sampling over the set union of chain, acyclic, and cyclic joins, with sample uniformity and independence guarantees. We study the novel problem of the union of joins size evaluation and propose two approximation methods based on histograms of columns and random walks on data. We propose an online union sampling framework that initializes with cheap-to-calculate parameter approximations and refines them on the fly during sampling. We evaluate our framework on workloads from the TPC-H benchmark and explore the trade-off of the accuracy of union approximation and sampling efficiency.

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

↑