1972
DOI: 10.6017/ital.v5i1.5723
|View full text |Cite
|
Sign up to set email alerts
|

A Truncated Search Key Title Index

Abstract: An experiment showing that 3, 1, 1, 1 search keys derived from titles are sufficiently specific to be an efficient computerized, interactive index to a file of 135,938 MARC II records.This paper reports the findings of an experiment undertaken to design a title index to entries in the Ohio College Library Center's on-line shared cataloging system. Several large libraries participating in the center requested a title index because experience in those libraries had shown that the staff could locate entries in fi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1972
1972
2003
2003

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 1 publication
0
6
0
Order By: Relevance
“…Of the three experimental articles on truncated search keys produced at OCLC from 1970 to 1972, the third, and most important, was written by Philip L. Long and the present author (Long & Kilgour, 1972). We found that a 3, 1, 1, 1 title search key produced five or fewer listings 99.1% of the time from an online file of 135,938 entries.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Of the three experimental articles on truncated search keys produced at OCLC from 1970 to 1972, the third, and most important, was written by Philip L. Long and the present author (Long & Kilgour, 1972). We found that a 3, 1, 1, 1 title search key produced five or fewer listings 99.1% of the time from an online file of 135,938 entries.…”
Section: Literature Reviewmentioning
confidence: 99%
“…8 no. 3 Kilgour (6,7,8,9) and his associates at the Ohio College Library Center have used truncated keys derived from both personal author and titles in order to retrieve entries from a large on-line file of catalogue records. These keys were successful for the purpose they were designed for.…”
Section: Programmentioning
confidence: 99%
“…The calculation of a home address comprises derivation of a search key from the record to be stored or retrieved and the hashing or randomizing of the key to obtain an integer, relative record address that is converted to a storage home address. The findings of OCLC research on search keys has been reported (9,10,11).…”
Section: Index Filesmentioning
confidence: 99%