An objective method of “weeding” bibliographic databases

Eugene Wall

Journal of the American Society for Information Science, 1986, vol. 37, issue 4, 256-260

Abstract: As computerized bibliographic databases have become larger (and older, on average), storage and search costs and the costs of scanning the larger search outputs to identify the most useful records have all also become greater. A method is described for identifying periodically those database records with minimal utility to a database's clientele, so that such records can be removed to a batch‐search database, thereby reducing the costs of on‐line database storage and use and enhancing the average utility of query responses. The technique, which was proved experimentally long ago and which requires a database with records indexed using a controlled vocabulary, identifies (for retention in an on‐line database) those documents most often indexed by terms most often used in recent queries and enables a quantitative measure of overall utility to be calculated for each document. Because the distribution of numbers of records versus document utility is heavily skewed toward low utility, extraction from the database of even a large fraction of its records will still leave many records with a low value of calculated utility, thus serving as a “fail‐safe” mechanism. Means for selecting rationally and easily the “cutoff point” as to document utility (as to those records which should be retained on line) are described. Several potential serendipitous benefits of such a weeding operation are suggested. The costs of such an operation should be modest. © 1986 John Wiley & Sons, Inc.

Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(198607)37:43.0.CO;2-7

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:37:y:1986:i:4:p:256-260

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