MemoryEfficientHashJoins计算机论文概要总结.docVIP

Memory Efficient Hash Joins 高储存效率的哈希链接 翻译: 计科二班 泰泰 R. Barber G. Lohman I. Pandis V. Raman R. Sidle IBM Research – Almaden G. Attaluri N. Chainani S. Lightstone D. Sharpe IBM Software Group ABSTRACT摘要 We present new hash tables for joins, and a hash join based on them, that consumes far less memory and is usually faster than recently published in-memory joins. 我们提出了新型的哈希连接表和一个基于此的哈希连接.这种新连接占用了小的多的存储空间,并且还能够做到通常情况下快于近期发表的内存数据库哈希连接. Our hash join is not restricted to outer tables that fit wholly in memory.Key to this hash join is a new concise hash table (CHT), a linear probing hash table that has 100% fill factor, and uses a sparse bitmap with embedded population counts to almost entirely avoid collisions. 我们的哈希连接并不局限于完全匹配于内存的的外部表.这个哈希连接的关键字是一种全新且简洁的哈希表(CHT)-------一个有着100%填充因子的线性探查的哈希表,并且使用了嵌入人口计数的稀疏位图来实现几乎完全避免碰撞. This bitmap also serves as a Bloom filter for use in multi-table joins. 这个位图在多表连接中也做为布鲁姆过滤器. We study the random access characteristics of hash joins,and renew the case for non-partitioned hash joins. We introduce a variant of partitioned joins in which only the build is partitioned, but the probe is not, as this is more efficient for large outer tables than traditional partitioned joins. 我们研究了这个哈希连接的随机访问,并且更新并更新了非分区哈希连接的情形.我们引进了一种分区连接的变种,其中,只有建立时分区.但探查并不是这样,因为这样做对于外部表相比传统的分区连接更有效率. This also avoids partitioning costs during the probe, while at the same time allowing parallel build without latching overheads. Additionally, we present a variant of CHT, called a concise array table (CAT), that can be used when the key domain is moderately dense. CAT is collision-free and avoids storing join keys in the hash table. 这样也避免了探查时的分区开销,同时也允许无栓锁开销的平行构建.除此之外,我们提供了一种CHT的变种---------叫做简洁排列表(CAT).CAT可以在关键字区域是中等密度时使用.CAT是无碰撞的,而且可以避免在哈希表之中保存连接关键字. We perform a detailed comparison of CHT and CAT against leading in-memory hash joins. Our experiments show that we can reduce the memory usage by one to three orders of magnitude, while also being competitive in performance. 我们用CHT