5 ms·
Hi @nikita, good to reconnect. When you say an array and not a hash table, do you just mean a simple perfect hash table indexed by the offset of the dictionary
by tmostak 6y ago
Hi @nikita, good to reconnect.
When you say an array and not a hash table, do you just mean a simple perfect hash table indexed by the offset of the dictionary id? We use this fairly extensively for inputs of bounded domain (i.e. dictionary-encoded strings, moderately-sized integer ranges, even binned values, numeric or timestamp), but call it a perfect hashing. Assume we're talking about the same thing but wanted to clarify.
- nikita 6y agoYes, that’s it. I’m still of an opinion that it’s important to demonstrate performance on more complex queries with joins, subqueries, subselects, and clustered data movements. The count(*), group by query is a very very simple case.