Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries

07/03/2019
by   Ahmet Kara, et al.
0

We investigate trade-offs in static and dynamic evaluation of hierarchical queries with arbitrary free variables. In the static setting, the trade-off is between the time to partially compute the query result and the delay needed to enumerate its tuples. In the dynamic setting, we additionally consider the time needed to update the query result in the presence of single-tuple inserts and deletes to the input database. Our approach observes the degree of values in the database and uses different computation and maintenance strategies for high-degree and low-degree values. For the latter it partially computes the result, while for the former it computes enough information to allow for on-the-fly enumeration. The main result of this work defines the preprocessing time, the update time, and the enumeration delay as functions of the light/heavy threshold and of the factorization width of the hierarchical query. By conveniently choosing this threshold, our approach can recover a number of prior results when restricted to hierarchical queries.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/17/2022

Conjunctive Queries with Output Access Patterns under Updates

We study the dynamic evaluation of conjunctive queries with output acces...
09/28/2017

Answering UCQs under updates and in the presence of integrity constraints

We investigate the query evaluation problem for fixed queries over fully...
01/09/2022

New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS

We study the maximum matching problem in fully dynamic graphs: a graph i...
04/20/2022

JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing

Approximate query processing over dynamic databases, i.e., under inserti...
04/07/2020

Maintaining Triangle Queries under Updates

We consider the problem of incrementally maintaining the triangle querie...
12/01/2017

Fundamental Limits on Data Acquisition: Trade-offs between Sample Complexity and Query Difficulty

In this paper, we consider query-based data acquisition and the correspo...
01/29/2020

Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis

Interprocedural data-flow analyses form an expressive and useful paradig...