JavaScript is disabled for your browser. Some features of this site may not work without it.
The Efficiency of Inverted Index and Cluster Searches

Author
Voorhees, Ellen M.
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.
Date Issued
1986-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-751
Type
technical report