Approximate Query Processing Based on Approximate Materialized View

被引:0
|
作者
Wu, Yuhan [1 ]
Guo, Haifeng [1 ]
Yang, Donghua [1 ]
Li, Mengmeng [1 ]
Zheng, Bo [2 ]
Wang, Hongzhi [1 ]
机构
[1] Harbin Inst Technol, Harbin, Peoples R China
[2] ConDB, Beijing, Peoples R China
关键词
Approximate materialized view; Materialized views reuse; AQP plus plus optimization; Approximate query processing; GROUP-BY;
D O I
10.1007/978-981-97-0801-7_10
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the context of big data, the interactive analysis database system needs to answer aggregate queries within a reasonable response time. The proposed AQP++ framework can integrate data preprocessing and AQP. It connects existing AQP engine with data preprocessing method to complete the connection between them in the process of interaction analysis. After the research on the application of materialized views in AQP++ framework, it is found that the materialized views used in the two parts of the framework both come from the accurate results of precomputation, so there's still a time bottleneck under large scale data. Based on such limitations, we proposed to use approximate materialized views for subsequent results reuse. We take the method of identifying approximate interval as an example, compared the improvement of AQP++ by using approximate materialized view, and trying different sampling methods to find better time and accurate performance results. By constructed larger samples, we compared the differences of time, space and accuracy between approximate and general materialized views in AQP++, and analyzed the reasons for the poor performance in some cases of our methods. Based on the experimental results, it proved that the use of approximate materialized view can improve the AQP++ framework, it effectively save time and storage space in the preprocessing stage, and obtain the accuracy similar to or better than the general AQP results as well.
引用
收藏
页码:168 / 185
页数:18
相关论文
共 50 条
  • [21] Approximate query processing model for mobile computing
    Madria, SK
    Mohania, M
    Roddick, JF
    INFORMATION ORGANIZATION AND DATABASES: FOUNDATIONS OF DATA ORGANIZATION, 2000, 579 : 207 - 219
  • [22] Optimizing the Resource Allocation for Approximate Query Processing
    Yarygina, Anna
    Novikov, Boris
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS, 2013, 186 : 297 - 308
  • [23] EntropyDB: a probabilistic approach to approximate query processing
    Laurel Orr
    Magdalena Balazinska
    Dan Suciu
    The VLDB Journal, 2020, 29 : 539 - 567
  • [24] Scalable Approximate Query Processing with the DBO Engine
    Jermaine, Chris
    Arumugam, Subramanian
    Pol, Abhijit
    Dobra, Alin
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2008, 33 (04):
  • [25] Approximate Query Processing for Interactive Data Science
    Kraska, Tim
    SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, : 525 - 525
  • [26] Optimized stratified sampling for approximate query processing
    Chaudhuri, Surajit
    Das, Gautam
    Narasayya, Vivek
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2007, 32 (02):
  • [27] EntropyDB: a probabilistic approach to approximate query processing
    Orr, Laurel
    Balazinska, Magdalena
    Suciu, Dan
    VLDB JOURNAL, 2020, 29 (01): : 539 - 567
  • [28] Efficient approximate query processing framework based on conditional generative model
    Bai W.-C.
    Han X.-X.
    Wang J.-B.
    Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2022, 56 (05): : 995 - 1005
  • [29] An approximate query processing method based on data correlation in sensor networks
    Jin, Hu
    Ren, Qianqian
    Li, Jinbao
    Shi, Yong
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS, 2008, : 13 - 18
  • [30] A Sampling-based Hybrid Approximate Query Processing System in the Cloud
    Wang, Yuxiang
    Luo, Junzhou
    Song, Aibo
    Dong, Fang
    2014 43RD INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2014, : 291 - 300