January 1, 1986

The efficiency of inverted index and cluster searches

EVEllen M. VoorheesNational Institute of Standards and Technology

Key Points

Key points are not available for this paper at this time.

Abstract

The processing time and disk space requirements of an inverted index and top-down cluster search are compared. The cluster search is shown to use both more time and more disk space, mostly due to the large number of cluster centroids needed by the search. When shorter centroids are used, the efficiency of the cluster search improves, but the inverted index search remains more efficient.

Ask AI

Helpful

Bookmark

View Full Paper

Cite This Study

Ellen M. Voorhees (Wed,) studied this question.

synapsesocial.com/papers/6a125974965b75813866da28 https://doi.org/https://doi.org/10.1145/253168.253203

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The Effectiveness and Efficiency of Agglomerative Hierarchic Clustering in Document Retrieval1985 · 122 citations
2Characterization of Two New Experimental Collections in Computer and Information Science Containing Textual and Bibliographic Concepts1983 · 72 citations
3The SMART Retrieval System—Experiments in Automatic Document Processing1971 · 2,277 citations
4The use of hierarchic clustering in information retrieval1971 · 523 citations
5Optimization of inverted vector searches1985 · 217 citations

Ask AI

Helpful

Bookmark

View Full Paper