滑动块（Slick）哈希：实现与基准测试
Sliding Block (Slick) Hashing: An Implementation & Benchmarks
AI总结：
本文实现了轻量级哈希表 Slick Hash，并通过基准测试分析其性能及条目删除中后院清理的影响，验证其在空间与速度间的实际平衡效果。
摘要：
哈希表是最常用的数据结构之一，Lehmann、Sanders 和 Walzer 提出了一种新颖的轻量级哈希表，称为 Slick Hash。他们的想法是在空间消耗和速度之间取得最佳平衡。基于作者的理论思想，需要通过实现和实验来评估 Slick Hash 的实际性能。本工作通过提供 Slick Hash 的基本实现、对其性能的分析以及对条目删除的评估（重点关注后院清理的影响）来满足这一要求。对研究结果进行了讨论，并得出了结论。
英文摘要：
With hash tables being one of the most used data structures, Lehmann, Sanders and Walzer propose a novel, light-weight hash table, referred to as Slick Hash. Their idea is to hit a sweet spot between space consumption and speed. Building on the theoretical ideas by the authors, an implementation and experiments are required to evaluate the practical performance of Slick Hash. This work contributes to fulfilling this requirement by providing a basic implementation of Slick Hash, an analysis of its performance, and an evaluation of the entry deletion, focusing on the impact of backyard cleaning. The findings are discussed, and a conclusion is drawn.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
