Show simple item record

dc.contributor.authorCambazoglu, B. B.en_US
dc.contributor.authorKayaaslan, E.en_US
dc.contributor.authorJonassen, S.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T09:34:27Z
dc.date.available2016-02-08T09:34:27Z
dc.date.issued2013en_US
dc.identifier.issn1559-1131
dc.identifier.urihttp://hdl.handle.net/11693/20751
dc.description.abstractIn a shared-nothing, distributed text retrieval system, queries are processed over an inverted index that is partitioned among a number of index servers. In practice, the index is either document-based or term-based partitioned. This choice is made depending on the properties of the underlying hardware infrastructure, query traffic distribution, and some performance and availability constraints. In query processing on retrieval systems that adopt a term-based index partitioning strategy, the high communication overhead due to the transfer of large amounts of data from the index servers forms a major performance bottleneck, deteriorating the scalability of the entire distributed retrieval system. In this work, to alleviate this problem, we propose a novel inverted index partitioning model that relies on hypergraph partitioning. In the proposed model, concurrently accessed index entries are assigned to the same index servers, based on the inverted index access patterns extracted from the past query logs. The model aims tominimize the communication overhead that will be incurred by future queries while maintaining the computational load balance among the index servers. We evaluate the performance of the proposed model through extensive experiments using a real-life text collection and a search query sample. Our results show that considerable performance gains can be achieved relative to the term-based index partitioning strategies previously proposed in literature. In most cases, however, the performance remains inferior to that attained by document-based partitioning. © 2013 ACM.en_US
dc.language.isoEnglishen_US
dc.source.titleACM Transactions on the Weben_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/2516633.2516637en_US
dc.subjectWeb search engineen_US
dc.subjectTerm-based index partitioningen_US
dc.subjectDistributed query processingen_US
dc.subjectHypergraph partitioningen_US
dc.titleA term-based inverted index partitioning model for efficient distributed query processingen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Technology and Information Systemsen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage15:1en_US
dc.citation.epage15:23en_US
dc.citation.volumeNumber7en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1145/2516633.2516637en_US
dc.publisherAssociation for Computing Machineryen_US
dc.contributor.bilkentauthorAykanat, Cevdet


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record