Comparative analysis of two hash table filling strategies
Abstract
Two strategies for filling hash tables consisting of several subtables are considered, without displacing previously inserted elements, one of which is based on sequential, the other on uniform filling of subtables. An analytical model is proposed for estimating the parameters of filling in the subtables and the combined hash table for the two strategies under consideration. Computer modeling was carried out, which confirmed the high accuracy of the proposed model and the advantage of a strategy based on sequential filling of subtables.
Fields of Study & Subjects
Algorithms and Data Compression
Network Packet Processing and Optimization
Optimization and Search Problems
Publication details
- Journal / source
- INFORMACIONNYE TEHNOLOGII
- Volume
- 32
- Issue
- 1
- Pages
- 3–11
- Publication date
- 15 January 2026
- Language
- EN