【摘要】 连接聚集操作是一种常用并且非常耗时的数据库操作.相对于准确查询,满足用户给定置信区间的近似结果由于其快得多的响应时间,更受用户的欢迎.作者分析发现现有的工作无法以既高效又满足给定的任意置信区间方式来处理近似连接聚集,因此提出了一种新的算法——(p,ε)-近似连接聚集查询(pε-AJA)来有效地返回满足任意置信区间的近似连接聚集结果.文章提出且预计算两个数据结构:连接随机样本(JRS)和连接位置索引对表(JPIPT).利用JRS,pε-AJA向用户返回近似结果的快速响应.如果利用JRS得到的近似结果没有满足给定的置信区间,pε-AJA利用JPIPT获得更多的随机连接元组.文中提出一种采样算法来获得JPIPT给定数量的样本,并且利用获得的JPIPT样本,该文提出的算法可通过对连接表的一遍顺序扫描获得连接元组.该文还提供了JPIPT和JRS有效的构建和维护算法.实验结果表明:pε-AJA可以获得相对于准确查询1～5个数量级的加速,并且可以有效地完成JPIPT和JRS的构建和维护操作.更多还原

【Abstract】 Join aggregate is a commonly used but time-consuming operation in database.Comparing to exact queries,approximate results satisfying user-specified confidence intervals are more attractive for their much faster responses.None of the previous work can process approximate join aggregate with both high efficiency and an arbitrarily specified confidence interval.This paper proposes a novel algorithm,(p,ε)-Approximate Join Aggregate(pε-AJA),which is able to return approximate results for arbitrary confidence interval efficiently.Two data structures,join random sample(JRS)and join positional index pair table(JPIPT),are presented and pre-computed in pε-AJA.pε-AJA first makes use of JRS to make a quick response of approximate results to users.If the approximate results from JRS do not satisfy the given confidence interval,JPIPT is exploited to obtain more random join tuples.A sampling algorithm is provided to sample JPIPT tuples of specified size.Algorithms are also presented to retrieve join tuples by sampled JPIPT tuples in one-pass sequential scan.The construction and maintenance of JPIPT and JRS are provided in this paper.The experimental results show that pε-AJA obtains approximate results for arbitrary confidence intervals with a speedup by 1 to 5 orders of magnitude compared to exact queries and the update operations for JPIPT and JRS are efficient.更多还原