The Bathroom Model: A Realistic Approach to Hash Table Algorithm Optimization
Qiantong Wang

TL;DR
This paper introduces the Bathroom Model, an adaptive hash table probing strategy inspired by human restroom stall choices, which improves search efficiency by dynamically adjusting based on occupancy patterns.
Contribution
It presents a novel, formalized adaptive probing model for hash tables that outperforms traditional fixed and random strategies in efficiency and adaptability.
Findings
Adaptive probing improves search efficiency
Dynamic updates outperform static thresholds
Minimal additional computational overhead
Abstract
Hash table search strategies have remained a pivotal area of inquiry in computer science over the past several decades. A prevailing viewpoint asserts that random probing stands as the optimal method for open-addressing hash tables. Challenging this long-standing belief, a recent contribution introduces an elastic probing technique based on fixed interval thresholds. Although this method presents improvements over traditional strategies, its dependence on static thresholds limits its theoretical optimality. In this paper, we propose a new conceptual model for optimizing hash table probing, inspired by human behavior in selecting restroom stalls - dubbed the "Bathroom Model." Unlike fixed or purely random approaches, our technique dynamically updates probing decisions using previously observed occupancy patterns, resulting in a more intelligent and adaptive search process. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Cloud Computing and Resource Management · Caching and Content Delivery
