Document - Query processing in highly-loaded search engines

2013

Conference article Open Access

Query processing in highly-loaded search engines

Broccolo D., Macdonald C., Orlando S., Ounis I., Perego R., Silvestri F., Tonellotto N.

Distributed Search Engines Throughput. Effectiveness H.3.3 Information Search and Retrieval Efficiency

While Web search engines are built to cope with a large number of queries, query traffic can exceed the maximum query rate supported by the underlying computing infrastructure. We study how response times and results vary when, in presence of high loads, some queries are either interrupted after a fixed time threshold elapses or dropped completely. Moreover, we introduce a novel dropping strategy, based on machine learned performance predictors to select the queries to drop in order to sustain the largest possible query rate with a relative degradation in effectiveness.

Source: SPIRE'13 - String Processing and Information Retrieval. 20th International Symposium, pp. 49–55, Jerusalem, 7-9 October 2013

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:277741,
	title = {Query processing in highly-loaded search engines},
	author = {Broccolo D. and Macdonald C. and Orlando S. and Ounis I. and Perego R. and Silvestri F. and Tonellotto N.},
	doi = {10.1007/978-3-319-02432-5_9},
	booktitle = {SPIRE'13 - String Processing and Information Retrieval. 20th International Symposium, pp. 49–55, Jerusalem, 7-9 October 2013},
	year = {2013}
}