JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing

04/20/2022
by   Xi Liang, et al.
0

Approximate query processing over dynamic databases, i.e., under insertions/deletions, has applications ranging from high-frequency trading to internet-of-things analytics. We present JanusAQP, a new dynamic AQP system, which supports SUM, COUNT, AVG, MIN, and MAX queries under insertions and deletions to the dataset. JanusAQP extends static partition tree synopses, which are hierarchical aggregations of datasets, into the dynamic setting. This paper contributes new methods for: (1) efficient initialization of the data synopsis in the presence of incoming data, (2) maintenance of the data synopsis under insertions/deletions, and (3) re-optimization of the partitioning to reduce the approximation error. JanusAQP reduces the error of a state-of-the-art baseline by more than 60 JanusAQP can process more than 100K updates per second in a single node setting and keep the query latency at a millisecond level.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2019

Conjunctive Queries with Theta Joins Under Updates

Modern application domains such as Composite Event Recognition (CER) and...
research
06/14/2018

An Improved Energy-Aware Clustering Method for the Regional Queries in the Internet of Things

We will offer a method to improve energy efficient consumption for proce...
research
07/03/2019

Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries

We investigate trade-offs in static and dynamic evaluation of hierarchic...
research
10/25/2020

Approximating Aggregated SQL Queries With LSTM Networks

Despite continuous investments in data technologies, the latency of quer...
research
05/30/2018

Q-Graph: Preserving Query Locality in Multi-Query Graph Processing

Arising user-centric graph applications such as route planning and perso...
research
02/22/2021

ikd-Tree: An Incremental K-D Tree for Robotic Applications

This paper proposes an efficient data structure, ikd-Tree, for dynamic s...
research
05/22/2020

Still Simpler Static Level Ancestors

A level-ancestor or LA query about a rooted tree T takes as arguments a ...

Please sign up or login with your details

Forgot password? Click here to reset