Results 1 to 10 of about 647,966 (230)
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.
A Goerdt +13 more
arxiv +9 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 +9 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
A polynomial time generator for minimal perfect hash functions [PDF]
Communications of the ACM, 1985 A perfect hash function PHF is an injection F from a set W of M objects into the set consisting of the first N nonnegative integers where N ⩾ M. If N = M, then F is a minimal perfect hash function, MPHF. PHFs are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly ...
Thomas J. Sager
semanticscholar +4 more sources
An informal analysis of perfect hash function search
Applied Mathematics Letters, 1989 AbstractA brief explanation of perfect hash function search is presented followed by an informal analysis of the problem.
Nick Cercone, Max Krause
semanticscholar +4 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
Efficient Cancelable Template Generation Based on Signcryption and Bio Hash Function
Axioms, 2022 Cancelable biometrics is a demanding area of research in which a cancelable template conforming to a biometric is produced without degrading the efficiency.
Vani Rajasekar +5 more
doaj +2 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
Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2021 A function $f : U \to \lbrace 0,\ldots,n-1\rbrace$f:U→{0,...,n-1} is a minimal perfect hash function for a set $S \subseteq U$S⊆U of size $n$n, if $f$f bijectively maps $S$S into the first $n$n natural numbers.
Giulio Ermanno Pibiri, Roberto Trani
openalex +3 more sources