Hierarchical and Efficient Synopsis Construction for Bounded Approximate Query Processing

• Published in: Journal of Information Processing Vol. 33; pp. 115 - 127
• Main Authors: Ni, Tianjia, Sugiura, Kento, Ishikawa, Yoshiharu, Lu, Kejing
• Format: Journal Article
• Language: English
• Published: Information Processing Society of Japan 2025; 一般社団法人 情報処理学会
• Subjects: aggregate estimation; approximate query processing; query processing
• ISSN: 1882-6652
• DOI: 10.2197/ipsjjip.33.115

Approximate query processing (AQP) has gained traction as an effective technique for executing queries on big data. Bounded approximate query processing (BAQ) is a recently proposed framework that stores a summary of an original table as a synopsis and ensures that its approximation errors remain below a user-specified threshold. Based on the BAQ framework, we have extended it to BAQ± to guarantee strictly bounded errors for more diverse data. However, BAQ and BAQ± still have problems when constructing synopses. They require time-consuming data sorting for each numerical attribute and cannot summarize high-cardinality categorical attributes, such as spatiotemporal data. To overcome these problems, we propose a novel framework called Hierarchical BAQ (HBAQ) and a synopsis construction method in this paper. HBAQ constructs multiple synopses based on the dimension tables of several categorical attributes and uses them to answer OLAP queries efficiently. We also introduce a new bucket definition to summarize numerical attributes effectively and support incremental updates for synopses. We conducted extensive experiments with several datasets. The experimental results show that HBAQ achieved half the construction time of BAQ with lower memory consumption. Furthermore, HBAQ could answer OLAP queries more efficiently than BAQ using hierarchically constructed synopses.