Relations stored as compact quadtrees can answer join queries in worst-case optimal time, using a new qdag structure to lift relations to the query's full dimension.
\'A lvarez-Garc \' a, N
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Joins using Compact Data Structures
Relations stored as compact quadtrees can answer join queries in worst-case optimal time, using a new qdag structure to lift relations to the query's full dimension.