title: A two-level cache for distributed information retrieval in search engines.
abstract: 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.
authors.affiliation: School of Computer Science and Technology, Harbin Institute of Technology, P.O. Box 320, Harbin 150001, China.
authors.forename: Weizhe
authors.initials: W
authors.lastname: Zhang
authors.affiliation: School of Computer Science and Technology, Harbin Institute of Technology, P.O. Box 320, Harbin 150001, China.
authors.forename: Hui
authors.initials: H
authors.lastname: He
authors.affiliation: School of Computer Science and Technology, Harbin Institute of Technology, P.O. Box 320, Harbin 150001, China.
authors.forename: Jianwei
authors.initials: J
authors.lastname: Ye
mesh_terms: D003195:Computer Communication Networks / Q000706:statistics & numerical data; D016247:Information Storage and Retrieval / Q000379:methods* / Q000706:statistics & numerical data; D020407:Internet / Q000706:statistics & numerical data; D057386:Search Engine / Q000706:statistics & numerical data