Cover Image

PHast -- Perfect Hashing made fast

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Beling, Piotr, Sanders, Peter
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Databases Performance
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
by: Chen, Yuan, et al.
Published: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
by: Balasubramanian, Shrinivass Arunachalam
Published: (2025)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)

Don't Persist All : Efficient Persistent Data Structures
by: Mahapatra, Pratyush, et al.
Published: (2019)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
by: Lehmann, Hans-Peter, et al.
Published: (2023)

Engineering Minimal k-Perfect Hash Functions
by: Hermann, Stefan, et al.
Published: (2025)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
by: Lehmann, Hans-Peter, et al.
Published: (2025)

Modern Minimal Perfect Hashing: A Survey
by: Lehmann, Hans-Peter, et al.
Published: (2025)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
by: Hermann, Stefan, et al.
Published: (2024)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
by: Bessa, Aline, et al.
Published: (2023)

Setchain Algorithms for Blockchain Scalability
by: Karmegam, Arivarasan, et al.
Published: (2025)

Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)

Less is More: Faster Maximum Clique Search by Work-Avoidance
by: Vandierendonck, Hans
Published: (2025)

Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
by: Mazziane, Younes Ben, et al.
Published: (2026)

FRSZ2 for In-Register Block Compression Inside GMRES on GPUs
by: Grützmacher, Thomas, et al.
Published: (2024)

Virtual-Memory Powersort
by: Moltmann, Finn, et al.
Published: (2026)

Accurate and Fast Approximate Graph Pattern Mining at Scale
by: Arpaci-Dusseau, Anna, et al.
Published: (2024)

Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)

Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024)

HashEvict: A Pre-Attention KV Cache Eviction Strategy using Locality-Sensitive Hashing
by: Liu, Minghui, et al.
Published: (2024)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
by: Kosolobov, Dmitry
Published: (2024)

MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
by: Hermann, Stefan
Published: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
by: Koerkamp, Ragnar Groot
Published: (2025)

JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
by: Ertl, Otmar
Published: (2024)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
by: Koehler, Henning, et al.
Published: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

Smaller and More Flexible Cuckoo Filters
by: Schmitz, Johanna Elena, et al.
Published: (2025)

Clustering with Set Outliers and Applications in Relational Clustering
by: Surianarayanan, Vaishali, et al.
Published: (2025)

Towards Lazy B-Trees
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)

Hilbert Forest in the SISAP 2025 Indexing Challenge
by: Imamura, Yasunobu, et al.
Published: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
by: Li, Zheng, et al.
Published: (2025)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)