文章基本信息

标题：Linear Hashing
本地全文：下载
作者：Noga Alon ; Martin Dietzfelbinger ; Peter Bro Miltersen 等
期刊名称：BRICS Report Series
印刷版ISSN：0909-0878
出版年度：1997
卷号：4
期号：16
出版社：Aarhus University
摘要：Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good H is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n by a randomly chosen function from H and look at the expected size of the largest hash bucket. H is a universal class of hash functions for any finite field, but with respect to our measure different fields behave differently.