A Top-K-Based Cache Model for Deep Web Query

Yue Kou; Derong Shen; Ge Yu; Tiezheng Nie; Dong Li

2nd International ICST Conference on Scalable Information Systems

Research Article

A Top-K-Based Cache Model for Deep Web Query

Download1039 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/infoscale.2007.965,
    author={Yue Kou and Derong Shen and Ge Yu and Tiezheng Nie and Dong Li},
    title={A Top-K-Based Cache Model for Deep Web Query},
    proceedings={2nd International ICST Conference on Scalable Information Systems},
    proceedings_a={INFOSCALE},
    year={2010},
    month={5},
    keywords={Cache Model IR Top-K .Data Reorganization Deep Web.},
    doi={10.4108/infoscale.2007.965}
}

Yue Kou
Derong Shen
Ge Yu
Tiezheng Nie
Dong Li
Year: 2010
A Top-K-Based Cache Model for Deep Web Query
INFOSCALE
ICST
DOI: 10.4108/infoscale.2007.965

Yue Kou¹^,*, Derong Shen¹^,*, Ge Yu¹^,*, Tiezheng Nie¹^,*, Dong Li²^,*

1: School of Information Sci. & Eng Northeastern University Shenyang 110004, China 0086-24-83687776
2: Business Software Division Neusoft Group Ltd. Shenyang 110179, China 0086-24-83662207

*Contact email: kouyue@ise.neu.edu.cn, shenderong@ise.neu.edu.cn, yuge@ise.neu.edu.cn, nietiezheng@ise.neu.edu.cn, lidong@neusoft.com

Abstract

In this paper we focus on providing a cache model based on Top-K data source instead of expatiatory result records for deep web query. By integrating techniques from IR and Top-K, a data reorganization strategy is presented. Also some measures about cache management and optimization are proposed to improve the performances of cache effectively. Results from the simulation show the proposed cache model significantly improves query performance when compared with various alternate strategies.

Keywords: Cache Model, IR, Top-K, .Data Reorganization, Deep Web.

Published: 2010-05-16
Modified: 2011-09-11

: http://dx.doi.org/10.4108/infoscale.2007.965

A Top-K-Based Cache Model for Deep Web Query

Abstract

About EAI

Community

Publish with EAI