A Two-Level Cache for Distributed Information Retrieval in Search Engines

To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users’ logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache...

Full description

Saved in:
Bibliographic Details
Main Authors: Weizhe Zhang, Hui He, Jianwei Ye
Format: Article
Language:English
Published: Wiley 2013-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2013/596724
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850216479333548032
author Weizhe Zhang
Hui He
Jianwei Ye
author_facet Weizhe Zhang
Hui He
Jianwei Ye
author_sort Weizhe Zhang
collection DOAJ
description To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users’ logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache as an auxiliary to optimize the distribution of the cache data. We propose a distribution strategy of the cache data. The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.
format Article
id doaj-art-3c4d4eacf46b4dc6b73d1ce05ce78b3a
institution OA Journals
issn 1537-744X
language English
publishDate 2013-01-01
publisher Wiley
record_format Article
series The Scientific World Journal
spelling doaj-art-3c4d4eacf46b4dc6b73d1ce05ce78b3a2025-08-20T02:08:18ZengWileyThe Scientific World Journal1537-744X2013-01-01201310.1155/2013/596724596724A Two-Level Cache for Distributed Information Retrieval in Search EnginesWeizhe Zhang0Hui He1Jianwei Ye2School of Computer Science and Technology, Harbin Institute of Technology, P.O. Box 320, Harbin 150001, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, P.O. Box 320, Harbin 150001, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, P.O. Box 320, Harbin 150001, ChinaTo improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users’ logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache as an auxiliary to optimize the distribution of the cache data. We propose a distribution strategy of the cache data. The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.http://dx.doi.org/10.1155/2013/596724
spellingShingle Weizhe Zhang
Hui He
Jianwei Ye
A Two-Level Cache for Distributed Information Retrieval in Search Engines
The Scientific World Journal
title A Two-Level Cache for Distributed Information Retrieval in Search Engines
title_full A Two-Level Cache for Distributed Information Retrieval in Search Engines
title_fullStr A Two-Level Cache for Distributed Information Retrieval in Search Engines
title_full_unstemmed A Two-Level Cache for Distributed Information Retrieval in Search Engines
title_short A Two-Level Cache for Distributed Information Retrieval in Search Engines
title_sort two level cache for distributed information retrieval in search engines
url http://dx.doi.org/10.1155/2013/596724
work_keys_str_mv AT weizhezhang atwolevelcachefordistributedinformationretrievalinsearchengines
AT huihe atwolevelcachefordistributedinformationretrievalinsearchengines
AT jianweiye atwolevelcachefordistributedinformationretrievalinsearchengines
AT weizhezhang twolevelcachefordistributedinformationretrievalinsearchengines
AT huihe twolevelcachefordistributedinformationretrievalinsearchengines
AT jianweiye twolevelcachefordistributedinformationretrievalinsearchengines