Hacker News Reader

Uh, isn't this just radix-partitioned aggregation? Hierarchical (fixed two level) aggregation is old. What's novel here?

Microcosm of Pivot itself I guess. I just don't get why this project exists when DuckDB and Clickhouse both exist.

View on HN

From the article: "To do this, we'll use a method called radix partitioning."

I don't think they were claiming it was novel. Seemed just like an article explaining a performance optimization

I didn't get the sense that this was the end-all, just a relatively simple way to show how much impact cache-friendly data structures can have for somewhat little effort over the naive solution and give readers a sense for how to think through the problem.

Reply on news.ycombinator.com