Show simple item record

dc.contributor.advisorAykanat, Cevdet
dc.contributor.authorTokuç, A Aylin
dc.date.accessioned2016-01-08T18:07:45Z
dc.date.available2016-01-08T18:07:45Z
dc.date.issued2008
dc.identifier.urihttp://hdl.handle.net/11693/14774
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2008.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2008.en_US
dc.descriptionIncludes bibliographical references leaves 47-52.en_US
dc.description.abstractToday’s state-of-the-art search engines utilize the inverted index data structure for fast text retrieval on large document collections. To parallelize the retrieval process, the inverted index should be distributed among multiple index servers. Generally the distribution of the inverted index is done in either a term-based or a document-based fashion. The performances of both schemes depend on the total number of disk accesses and the total volume of communication in the system. The classical approach for both distributions is to use the Central Broker Query Evaluation Scheme (CB) for parallel text retrieval. It is known that in this approach the central broker is heavily loaded and becomes a bottleneck. Recently, an alternative query evaluation technique, named Pipelined Query Evaluation Scheme (PPL), has been proposed to alleviate this problem by performing the merge operation on the index servers. In this study, we analyze the scalability and relative performances of the CB and PPL under various query loads to report the benefits and drawbacks of each method.en_US
dc.description.statementofresponsibilityTokuç, A Aylinen_US
dc.format.extentxi, 52 leaves, graphsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectParallel text retrievalen_US
dc.subjectCentral broker query evaluationen_US
dc.subjectPipelined query evaluationen_US
dc.subjectTerm-based distributionen_US
dc.subjectDocument-based distrributionen_US
dc.subject.lccQA76.5 .T64 2008en_US
dc.subject.lcshParallel processing (Electronic computers).en_US
dc.subject.lcshText processing (Computer science).en_US
dc.titlePerformance comparison of query evaluation techniques in parallel text retrieval systemsen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB109728


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record