Show simple item record

dc.contributor.authorDushay, Naomien_US
dc.contributor.authorFrench, James C.en_US
dc.contributor.authorLagoze, Carlen_US
dc.date.accessioned2007-04-23T18:17:07Z
dc.date.available2007-04-23T18:17:07Z
dc.date.issued1999-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR99-1743en_US
dc.identifier.urihttps://hdl.handle.net/1813/7397
dc.description.abstractResource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search engines. This paper focuses on search engine performance as a criterion for search engine selection and defines two measurements of search engine performance: availability - will the search engine respond within a time limit and response time - how quickly will the search engine respond, given that it responds at all. We predicted both of these performance characteristics with a variety of algorithms, all of which required little computation time and combined past performance data for each search engine into a succinct record. We used operational data from the NCSTRL distributed digital library to make and evaluate predictions, and we found that simple prediction methods performed as well as more complex methods and that prediction accuracy was closely related to data consistency.en_US
dc.format.extent204308 bytes
dc.format.extent1144101 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePredicting Indexer Performance in a Distributed Digital Libraryen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics