arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2206.12380cs.DB
收藏

VIP散列--适应动态数据流行度的偏斜(扩展版)

VIP Hashing -- Adapting to Skew in Popularity of Data on the Fly (extended version)

Aarati Kakaraparthy, Jignesh M. Patel, Brian P. Kroth, Kwanghyun Park

摘要:

并非所有数据都同样受欢迎。通常,数据的某一部分比其余部分更频繁地被访问,这导致数据项的流行度出现偏差。适应这种不对称可以提高性能,过去已针对基于磁盘的设置对该主题进行了广泛研究。在这项工作中,我们考虑在内存中的数据结构,即哈希表,并显示如何可以利用倾斜的流行更高的性能。散列是一种低延迟操作,对缓存、分支预测和代码复杂度等因素的影响很敏感。这些因素使得在循环中学习特别具有挑战性,因为执行任何附加操作的开销可能很大。在本文中,我们提出了VIP哈希,一个完全在线的哈希表方法,使用轻量级的机制,学习的倾斜流行和适应的哈希表布局。这些机制是非阻塞的,并且它们的开销通过感测流行度分布中的变化来控制,以根据需要动态地打开/关闭学习机制。我们测试了VIP散列对Wiscer,一个自制的散列测量工具,产生的各种工作负载,并发现它提高了性能的存在偏斜(22%的提取操作吞吐量增加哈希表与一百万个键在低偏斜下,77%的增加在中等偏斜下),同时是强大的插入和删除操作,并改变流行的关键字分布。我们发现,VIP哈希减少了TPC-H查询9的端到端执行时间,这是最昂贵的TPC-H查询,在中等偏斜下减少了20%。

英文摘要:

All data is not equally popular. Often, some portion of data is more frequently accessed than the rest, which causes a skew in popularity of the data items. Adapting to this skew can improve performance, and this topic has been studied extensively in the past for disk-based settings. In this work, we consider an in-memory data structure, namely hash table, and show how one can leverage the skew in popularity for higher performance. Hashing is a low-latency operation, sensitive to the effects of caching, branch prediction, and code complexity among other factors. These factors make learning in-the-loop especially challenging as the overhead of performing any additional operations can be significant. In this paper, we propose VIP hashing, a fully online hash table method, that uses lightweight mechanisms for learning the skew in popularity and adapting the hash table layout. These mechanisms are non-blocking, and their overhead is controlled by sensing changes in the popularity distribution to dynamically switch-on/off the learning mechanism as needed. We tested VIP hashing against a variety of workloads generated by Wiscer, a homegrown hashing measurement tool, and find that it improves performance in the presence of skew (22% increase in fetch operation throughput for a hash table with one million keys under low skew, 77% increase under medium skew) while being robust to insert and delete operations, and changing popularity distribution of keys. We find that VIP hashing reduces the end-to-end execution time of TPC-H query 9, which is the most expensive TPC-H query, by 20% under medium skew.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑