Simple, Efficient, and Robust Hash Tables for Join Processing.
Simple, Efficient, and Robust Hash Tables for Join Processing Hash tables are probably the most versatile data structures for data processing. For that reason, CedarDB depends on hash table to perform some of the most crucial parts of its query execution engine. Most prominently, CedarDB implements relational joins as hash joins. This blog post assumes you know what a hash join is. If not, the Wikipedia article has a short introduction into the topic for you.
Read in full here:
This thread was posted by one of our members via one of our news source trackers.