This paper proposes a cache hierarchy that enables Web search engines to efficiently
process user queries. The different caches in the hierarchy are used to store pieces of data …

A parallel query processing method is proposed for the design and construction of web
search engines to efficiently deal with dynamic variations in query traffic. The method allows …

In practice, a search engine may fail to serve a query due to various reasons such as
hardware/network failures, excessive query load, lack of matching documents, or service …

A simulation methodology is proposed to evaluate the performance of large-scale Web
search engines hosted by datacenters. The salient features of the methodology are the use …

This paper proposes a two-level P2P caching strategy for Web search queries. The design is
suitable for a fully distributed service platform based on managed peer boxes (set-top-box or …

This paper proposes a strategy to reduce the amount of hardware involved in the solution of
search engine queries. It proposes using a secondary compact cache that keeps minimal …

Web search engines are composed of a large set of search nodes and a broker machine
that feeds them with queries. A location cache keeps minimal information in the broker to …

This paper proposes a method for reducing the number of search nodes involved in the
solution of queries arriving to a Web search engine. The method is applied by the query …

Los Motores de Búsqueda Web (WSEs) actuales están formados por cientos de nodos de
procesamiento, los cuales están particionados en grupos llamados servicios. Cada servicio …

A simulation methodology is proposed to evaluate the performance of large-scale Web
search engines hosted by datacenters. The salient features of the methodology are the use …