Abstract
This work demonstrates the application of ideas from the area of lattice path combinatorics to the analysis of a direct-access storage and retrieval scheme known as ‘linear probing’. The scheme pertains to a direct-access file which is used to store data records, identified by unique keys. A hashing scheme is used to assign a tentative storage location to an added data record. If the tentative physical record so selected is full, the file is scanned sequentially (in a cyclic manner) until an empty slot is found. The performance of the system is derived using lattice-path counting techniques. A computational procedure and a number of open problems are discussed.
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.
