How many cards per file guide? optimizing the two‐level file

Ben‐Ami Lipetz and Czetong T. Song

Journal of the American Society for Information Science, 1970, vol. 21, issue 2, 140-141

Abstract: A determination is made of the optimum ratio of records to file guides to minimize searching time in an ordered two‐level file such as a library card catalog. The solution is proportional to the square root of the number of records in the file container (card drawer). When scanning rates for cards and for file guides are equal, the solution is exactly the square root of file size. Simplifying assumptions employed in this determination are discussed. It is asserted that most library card catalogs contain far fewer file guides than would be justified in order to minimize searching time for users.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630210206

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:21:y:1970:i:2:p:140-141

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().