• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Second chance: a hybrid approach for dynamic result caching and prefetching in search engines

      Thumbnail
      View / Download
      1.2 Mb
      Author(s)
      Ozcan, R.
      Altingovde, I. S.
      Cambazoglu, B. B.
      Ulusoy, O.
      Date
      2013-12
      Source Title
      ACM Transactions on the Web
      Print ISSN
      1559-1131
      Publisher
      Association for Computing Machinery
      Volume
      8
      Issue
      1
      Pages
      3:1 - 3:22
      Language
      English
      Type
      Article
      Item Usage Stats
      182
      views
      178
      downloads
      Abstract
      Web search engines are known to cache the results of previously issued queries. The stored results typically contain the document summaries and some data that is used to construct the final search result page returned to the user. An alternative strategy is to store in the cache only the result document IDs, which take much less space, allowing results of more queries to be cached. These two strategies lead to an interesting trade-off between the hit rate and the average query response latency. In this work, in order to exploit this trade-off, we propose a hybrid result caching strategy where a dynamic result cache is split into two sections: an HTML cache and a docID cache. Moreover, using a realistic cost model, we evaluate the performance of different result prefetching strategies for the proposed hybrid cache and the baseline HTML-only cache. Finally, we propose a machine learning approach to predict singleton queries, which occur only once in the query stream. We show that when the proposed hybrid result caching strategy is coupled with the singleton query predictor, the hit rate is further improved. © 2013 ACM.
      Keywords
      Algorithms
      Experimentation
      Performance
      Web Search Engines
      Dynamic result caching
      Result prefetching
      Permalink
      http://hdl.handle.net/11693/12956
      Published Version (Please cite this version)
      http://dx.doi.org/10.1145/2536777
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy