Effectiveness of retrieval Key Abbreviation Schemes

Thomas C. Lowe

Journal of the American Society for Information Science, 1971, vol. 22, issue 6, 374-381

Abstract: Frequently it is useful to abbreviate or otherwise transform keys used for the retrieval of information. These transformations include the compression of long keys into a fixed field length by operations on characters or groups of characters, hash or random transformations in order to obtain a direct address, or phonetic coding to order to group together keys that are in some way similar. The various transformations have differing effects on file retrieval schemes. Given a transformation algorithm and data to be transformed, it is possible to characterize certain qualities of the algorithm that relate to retrieval problems. This paper is concerned with some measures of effectiveness of such transformation algorithms.

Date: 1971
References: Add references at CitEc
Citations:

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

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:22:y:1971:i:6:p:374-381

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 ().