TID hash joins
TID hash joins
复制标题
TID 哈希连接
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
E. Rahm
中科院分区：
文献类型：
--
作者：
R. Marek;E. Rahm
TID哈希（TID Hash Joins）是一种简单且记忆有效的方法，用于处理大型联接查询。它们基于标准哈希算法，但仅存储在哈希表中，而不是整个ttrples中存储tid/键对。通常，这将记忆要求降低了不仅仅是艺术数量级，从而带来了可观的好处。特别是，通过在很大程度上减少磁盘f/o的量，可以大大提高演出字节关系的性能。此外，支持由联接查询和OLTP交易组成的混合多用户工作负载的有效处理。我们提出了一项详细的模拟研究，以分析TID Hash连接的性能。特别是，我们确定了TID HASH加入最有益的条件。此外，我们将TID哈希与已提议处理混合工作量的自适应哈希算法进行比较。
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash table instead of entire ttrples. This typically reduces memory requirements by more than art order of magnitude bringing substantial benefits. In particular, performance for joins on Gigs-Byte relations can substantially be improved by reducing the amount of disk f/O to a large extent. Furthermore, efficient processing of mixed multi-user workloads consisting of both join queries and OLTP transactions is supported. We present a detailed simulation study to analyze the performance of TID hash joins. In particular, we identify the conditions under which TID hash joins are most beneficial. Furthermore, we compare TID hash join with adaptive hash join algorithms that have been proposed to deal with mixed workloads.