Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.064 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DAMA-UPC - Data Management Group de la Universitat Politècnica de Catalunya
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DAMA-UPC - Data Management Group de la Universitat Politècnica de Catalunya
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Using Evolutive Summary Counters for Efficient Cooperative Caching in Search Engines

Thumbnail
View/Open
tpds11.pdf (834,6Kb)
Share:
 
 
10.1109/TPDS.2011.162
 
  View Usage Statistics
Cita com:
hdl:2117/16552

Show full item record
Domínguez Sal, David
Aguilar Saborit, Josep
Surdeanu, Mihai
Larriba Pey, JosepMés informacióMés informacióMés informació
Document typeArticle
Defense date2012-04
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Description
We propose and analyze a distributed cooperative caching strategy based on the Evolutive Summary Counters (ESC), a new data structure that stores an approximated record of the data accesses in each computing node of a search engine. The ESC capture the frequency of accesses to the elements of a data collection, and the evolution of the access patterns for each node in a network of computers. The ESC can be efficiently summarized into what we call ESC-summaries to obtain approximate statistics of the document entries accessed by each computing node. We use the ESC-summaries to introduce two algorithms that manage our distributed caching strategy, one for the distribution of the cache contents, ESC-placement, and another one for the search of documents in the distributed cache, ESC-search. While the former improves the hit rate of the system and keeps a large ratio of data accesses local, the latter reduces the network traffic by restricting the number of nodes queried to find a document. We show that our cooperative caching approach outperforms state of the art models in both hit rate, throughput, and location recall for multiple scenarios, i.e., different query distributions and systems with varying degrees of complexity.
CitationDominguez, D. [et al.]. Using Evolutive Summary Counters for Efficient Cooperative Caching in Search Engines. "IEEE transactions on parallel and distributed systems", Abril 2012, vol. 23, núm. 4, p. 776-784. 
URIhttp://hdl.handle.net/2117/16552
DOI10.1109/TPDS.2011.162
ISSN1045-9219
Collections
  • DAMA-UPC - Data Management Group de la Universitat Politècnica de Catalunya - Articles de revista [14]
  • Departament d'Arquitectura de Computadors - Articles de revista [910]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
tpds11.pdf834,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina