Results 1 to 10 of about 76,072 (189)
Engineering Minimal k-Perfect Hash Functions [PDF]
Embedded Systems and ApplicationsGiven a set S of n keys, a k-perfect hash function (kPHF) is a data structure that maps the keys to the first m integers, where each output integer can be hit by at most k input keys.
Stefan Hermann +4 more
semanticscholar +9 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
openalex +3 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
Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2023 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
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions [PDF]
Embedded Systems and Applications, 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.
Dominik Bez +3 more
openalex +3 more sources
Fast Scalable Construction of (Minimal Perfect Hash) Functions [PDF]
, 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
openalex +5 more sources
Minimal perfect hash functions made simple [PDF]
Communications of the ACM, 1980 A method is presented for computing machine independent, minimal perfect hash functions of the form: hash value ← key length + the associated value of the key's first character + the associated value of the key's last character. Such functions allow single probe retrieval from minimally sized tables of identifier lists.
Richard J. Cichelli
openalex +2 more sources
Partially perfect hash functions for intersecting families [PDF]
, 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
openalex +3 more sources
Order-preserving minimal perfect hash functions and information retrieval [PDF]
ACM Transactions on Information Systems, 1991 Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required.
Edward A. Fox +3 more
openalex +3 more sources
Constructing Minimal Perfect Hash Functions Using SAT Technology
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 Minimal perfect hash functions (MPHFs) are used to provide efficient access to values of large dictionaries (sets of key-value pairs). Discovering new algorithms for building MPHFs is an area of active research, especially from the perspective of storage efficiency. The information-theoretic limit for MPHFs is 1/ln 2 ≈ 1.44 bits per key.
Sean Weaver, Marijn J. H. Heule
+12 more sources