Covers of query results
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 a...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Schloss Dagstuhl
2018
|