Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash
IEEE Transactions on Knowledge and Data Engineering · 2024-03 · 36 (3) · 1249-1259
DOI: 10.1109/tkde.2023.3303341 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2024-03. Verfasst von Giulio Ermanno Pibiri und 1 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 37 Literaturangaben. Gefördert von: European Union's Horizon Europe research and innovation programme EFRA project.
Abstract (Originalsprache)
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. These functions are important for many practical applications in computing, such as search engines, computer networks, and databases. Several algorithms have been proposed to build minimal perfect hash functions that: scale well to large sets, retain fast evaluation time, and take very little space, e.g., 2 – 3 bits/key. PTHash is one such algorithm, achieving very fast evaluation in compressed space, typically many times faster than other techniques. In this work, we propose a new construction algorithm for PTHash enabling: (1) multi-threading , to either build functions more quickly or more space-efficiently, and (2) external-memory processing , to scale to inputs much larger than the available internal memory. Only few other algorithms in the literature share these features, despite of their practical impact. We conduct an extensive experimental assessment on large real-world string collections and show that, with respect to other techniques, PTHash is competitive in construction time and space consumption, but retains 2 – 6× better lookup time.
Förderung
- European Union's Horizon Europe research and innovation programme EFRA project
Zitieren
APA
Pibiri, G. E., & Trani, R. (2024). Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash. IEEE Transactions on Knowledge and Data Engineering, 36(3), 1249-1259. https://doi.org/10.1109/tkde.2023.3303341
Vancouver
Pibiri GE, Trani R. Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash. IEEE Transactions on Knowledge and Data Engineering. 2024;36(3):1249-1259. doi:10.1109/tkde.2023.3303341
BibTeX
@article{Pibiri2024,
author = {Pibiri, Giulio Ermanno and Trani, Roberto},
title = {Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2024},
volume = {36},
number = {3},
pages = {1249--1259},
doi = {10.1109/tkde.2023.3303341}
}
EUVIMED