Analysis of linear probing with buckets
作者：
Highlights：
•
摘要
Consider a random-access file which consists of a given number of buckets. Each bucket contains a fixed number of slots. Storage and retrieval of records are performed using linear probing. The probabilities underlying the behavior of this addressing system are determined, and the relevant performance measures are derived.
论文关键词：
论文评审过程：Received 14 September 1981, Revised 18 August 1982, Available online 17 June 2003.
论文官网地址：https://doi.org/10.1016/0306-4379(83)90007-8
