Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6591
Title: The Efficiency of Inverted Index and Cluster Searches
Authors: Voorhees, Ellen M.
Keywords: computer science
technical report
Issue Date: May-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-751
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.
URI: http://hdl.handle.net/1813/6591
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-751.pdf1.4 MBAdobe PDFView/Open
86-751.ps368.77 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us