Results 1 to 10 of about 569,401 (216)
Fast Scalable Construction of (Minimal Perfect Hash) Functions [PDF]
arXiv, 2016 Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing techniques.
Marco Genuzio +2 more
arxiv +9 more sources
Balanced Families of Perfect Hash Functions and Their Applications [PDF]
Proc. of 34th ICALP (2007), 435-446, 2008 The construction of perfect hash functions is a well-studied topic. In this paper, this concept is generalized with the following definition. We say that a family of functions from $[n]$ to $[k]$ is a $\delta$-balanced $(n,k)$-family of perfect hash functions if for every $S \subseteq [n]$, $|S|=k$, the number of functions that are 1-1 on $S$ is ...
Noga Alon, Shai Gutner
arxiv +7 more sources
Partially perfect hash functions for intersecting families [PDF]
arXiv, 2018 Consider a large network with unknown number of nodes. Some of these nodes coordinate to perform tasks. The number of such coordination groups is also unknown. The only information about the network available is that any two coordinating groups share at least $t$ nodes.
Tapas Kumar Mishra
arxiv +5 more sources
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions [PDF]
arXiv, 2022 A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first |S| integers. It can be used as a building block in databases and data compression. RecSplit [Esposito et al., ALENEX'20] is currently the most space efficient practical minimal perfect hash function.
Dominik Bez +3 more
arxiv +7 more sources
Finding minimal perfect hash functions [PDF]
ACM SIGCSE Bulletin, 1986 A heuristic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function.
Gary Haggard, Kevin Karplus
+6 more sources
SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing [PDF]
arXiv, 2022 A Perfect Hash Function (PHF) is a hash function that has no collisions on a given input set. PHFs can be used for space efficient storage of data in an array, or for determining a compact representative of each object in the set. In this paper, we present the PHF construction algorithm SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
Lehmann, Hans-Peter +2 more
arxiv +5 more sources
Balanced families of perfect hash functions and their applications [PDF]
ACM Transactions on Algorithms, 2010 The construction of perfect hash functions is a well-studied topic. In this article, this concept is generalized with the following definition. We say that a family of functions from [ n ] to [ k ] is a δ-balanced ( n,k )-family of perfect hash functions if for every
Noga Alon, Shai Gutner
openalex +6 more sources
PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays [PDF]
arXiv, 2003 In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array. Keywords: Perfect hash function, Digraph, Implicit enumeration, Nijenhuis-Wilf combinatorial family.
Lins, Lauro +2 more
arxiv +5 more sources
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions [PDF]
BRICS Report Series, 1999 A new way of constructing (minimal) perfect hash functions is described. The<br />technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations.
Rasmus Pagh
openalex +4 more sources
A letter oriented minimal perfect hashing function [PDF]
ACM SIGPLAN Notices, 1982 Cichelli has presented a simple method for constructing minimal perfect hash tables of identifiers for small static word sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word.
Curtis R. Cook, R. R. Oldehoeft
openalex +3 more sources