Abstract
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: when a record is hashed into a full bucket, the file is scanned sequentially (in a cyclic manner) until a non-full bucket is found. The problem is related to some versions of an applied probability model which arises in economics (analysis of a decentralized market). The probabilities underlying the behavior of the addressing system are determined, and the relevant performance measures are derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
