Load-sensitive selective pruning for distributed search.

Daniele Broccolo|Craig Macdonald|Salvatore Orlando|Iadh Ounis|Raffaele Perego|Fabrizio Silvestri|Nicola Tonellotto


Anthology ID:DBLP:conf/cikm/BroccoloMOOPST13
Volume:22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013
Year:2013
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:379-388
URL:https://doi.org/10.1145/2505515.2505699
DOI:https://doi.org/10.1145/2505515.2505699
DBLP:conf/cikm/BroccoloMOOPST13
BibTeX:
@inproceedings{broccolo-2013-loadsensitive, author = {Daniele Broccolo and Craig Macdonald and Salvatore Orlando and Iadh Ounis and Raffaele Perego and Fabrizio Silvestri and Nicola Tonellotto}, editor = {Qi He and Arun Iyengar and Wolfgang Nejdl and Jian Pei and Rajeev Rastogi}, title = {{Load-sensitive selective pruning for distributed search}}, booktitle = {{22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013}}, pages = {379--388}, publisher = {ACM}, year = {2013}, url = {https://doi.org/10.1145/2505515.2505699}, doi = {https://doi.org/10.1145/2505515.2505699} }