On AsterixDB, hash-based group-by is faster for small in-memory workloads and few groups, while sort-based group-by is faster at high group cardinality and under memory pressure.
Astrahan, Mike W
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
[Experiments \& Analysis] Hash-Based vs. Sort-Based Group-By-Aggregate: A Focused Empirical Study [Extended Version]
On AsterixDB, hash-based group-by is faster for small in-memory workloads and few groups, while sort-based group-by is faster at high group cardinality and under memory pressure.