Covers of Query Results

09/05/2017
by   Ahmet Kara, et al.
0

We introduce succinct lossless representations of query results called covers that are subsets of these results, yet allow for constant-delay enumeration of all result tuples. We first study covers whose structures are given by hypertree decompositions of join queries. For any join query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time (up to a logarithmic factor in the database size). For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join. We then generalise covers from join queries to functional aggregate queries, which express a host of computational problems, e.g., evaluation of queries with joins and aggregates, in-database optimization, matrix chain multiplication, and inference in probabilistic graphical models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2020

Fast Join Project Query Evaluation using Matrix Multiplication

In the last few years, much effort has been devoted to developing join a...
research
01/19/2023

Work-Efficient Query Evaluation with PRAMs

The paper studies query evaluation in parallel constant time in the PRAM...
research
09/26/2019

Box Covers and Domain Orderings for Beyond Worst-Case Join Processing

Recent beyond worst-case optimal join algorithms Minesweeper and its gen...
research
03/12/2020

Topology Dependent Bounds For FAQs

In this paper, we prove topology dependent bounds on the number of round...
research
03/05/2023

Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice

Join queries involving many relations pose a severe challenge to today's...
research
06/24/2021

The Complexity of Boolean Conjunctive Queries with Intersection Joins

Intersection joins over interval data are relevant in spatial and tempor...
research
01/11/2022

Parallel Acyclic Joins with Canonical Edge Covers

In PODS'21, Hu presented an algorithm in the massively parallel computat...

Please sign up or login with your details

Forgot password? Click here to reset