Approximate Query Processing: What is New and Where to Go?: A Survey on Approximate Query Processing

被引:86
作者
Li, Kaiyu [1 ]
Li, Guoliang [1 ]
机构
[1] Tsinghua Univ, Dept Comp Sci, Beijing, Peoples R China
关键词
OLAP; Approximate query processing; Online aggregation; Offline synopses;
D O I
10.1007/s41019-018-0074-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Online analytical processing (OLAP) is a core functionality in database systems. The performance of OLAP is crucial to make online decisions in many applications. However, it is rather costly to support OLAP on large datasets, especially big data, and the methods that compute exact answers cannot meet the high-performance requirement. To alleviate this problem, approximate query processing (AQP) has been proposed, which aims to find an approximate answer as close as to the exact answer efficiently. Existing AQP techniques can be broadly categorized into two categories. (1) Online aggregation: select samples online and use these samples to answer OLAP queries. (2) Offline synopses generation: generate synopses offline based on a-priori knowledge (e.g., data statistics or query workload) and use these synopses to answer OLAP queries. We discuss the research challenges in AQP and summarize existing techniques to address these challenges. In addition, we review how to use AQP to support other complex data types, e.g., spatial data and trajectory data, and support other applications, e.g., data visualization and data cleaning. We also introduce existing AQP systems and summarize their advantages and limitations. Lastly, we provide research challenges and opportunities of AQP. We believe that the survey can help the partitioners to understand existing AQP techniques and select appropriate methods in their applications.
引用
收藏
页码:379 / 397
页数:19
相关论文
共 115 条
[1]   Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms [J].
Acharya, Jayadev ;
Diakonikolas, Ilias ;
Hegde, Chinmay ;
Li, Jerry ;
Schmidt, Ludwig .
PODS'15: PROCEEDINGS OF THE 33RD ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2015, :249-263
[2]  
Acharya S, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P574, DOI 10.1145/304181.304581
[3]  
Acharya S, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P275, DOI 10.1145/304181.304207
[4]  
Agarwal P. K., 2012, P 31 ACM SIGMOD SIGA, P23, DOI DOI 10.1145/2213556.2213562
[5]   Mergeable Summaries [J].
Agarwal, Pankaj K. ;
Cormode, Graham ;
Huang, Zengfeng ;
Phillips, Jeff M. ;
Wei, Zhewei ;
Yi, Ke .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2013, 38 (04)
[6]  
Agarwal S., 2013, EUROSYS
[7]   Knowing When You're Wrong: Building Fast and Reliable Approximate Query Processing Systems [J].
Agarwal, Sameer ;
Milner, Henry ;
Kleiner, Ariel ;
Talwalkar, Ameet ;
Jordan, Michael ;
Madden, Samuel ;
Mozafari, Barzan ;
Stoica, Ion .
SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2014, :481-492
[8]  
Agrawal S., 2000, VLDB
[9]  
[Anonymous], 2016, P WORKSHOP HUMAN IN
[10]  
Armbrust M., 2013, SIGMOD, P625