Query forwarding in geographically distributed search engines

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage97en_US
dc.citation.spage90en_US
dc.contributor.authorCambazoglu, B.B.en_US
dc.contributor.authorVarol, Emreen_US
dc.contributor.authorKayaaslan, Enveren_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorBaeza-Yates, R.en_US
dc.coverage.spatialGeneva, Switzerlanden_US
dc.date.accessioned2016-02-08T12:23:44Z
dc.date.available2016-02-08T12:23:44Z
dc.date.issued2010en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: July 19 - 23, 2010en_US
dc.description.abstractQuery forwarding is an important technique for preserving the result quality in distributed search engines where the index is geographically partitioned over multiple search sites. The key component in query forwarding is the thresholding algorithm by which the forwarding decisions are given. In this paper, we propose a linear-programming-based thresholding algorithm that significantly outperforms the current state-of-the-art in terms of achieved search efficiency values. Moreover, we evaluate a greedy heuristic for partial index replication and investigate the impact of result cache freshness on query forwarding performance. Finally, we present some optimizations that improve the performance further, under certain conditions. We evaluate the proposed techniques by simulations over a real-life setting, using a large query log and a document collection obtained from Yahoo!. © 2010 ACM.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:23:44Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2010en
dc.identifier.doi10.1145/1835449.1835467en_US
dc.identifier.urihttp://hdl.handle.net/11693/28554
dc.language.isoEnglishen_US
dc.publisherACMen_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1835449.1835467en_US
dc.source.titleSIGIR '10 Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrievalen_US
dc.subjectDistributed IRen_US
dc.subjectIndex replicationen_US
dc.subjectLinear programmingen_US
dc.subjectOptimizationen_US
dc.subjectQuery forwardingen_US
dc.subjectResult cachingen_US
dc.subjectSearch enginesen_US
dc.subjectDistributed IRen_US
dc.subjectDistributed search enginesen_US
dc.subjectDocument collectionen_US
dc.subjectGreedy heuristicsen_US
dc.subjectIndex replicationen_US
dc.subjectKey componenten_US
dc.subjectMultiple search sitesen_US
dc.subjectQuery forwardingen_US
dc.subjectQuery logsen_US
dc.subjectResult cachingen_US
dc.subjectSearch efficiencyen_US
dc.subjectThresholding algorithmsen_US
dc.subjectInformation retrievalen_US
dc.subjectNetwork routingen_US
dc.subjectOptimizationen_US
dc.subjectSearch enginesen_US
dc.subjectLinear programmingen_US
dc.titleQuery forwarding in geographically distributed search enginesen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Query forwarding in geographically distributed search engines.pdf
Size:
818.64 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering