Efficient top-k data sources ranking for Query on deep web

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Efficient Query processing on deep web has been gaining great importance due to large amount of deep web data sources. Nevertheless, how to discover the most relevant data sources on deep web is still a challenging issue. Inspired by observations on deep web, the paper presents a novel top-k ranking strategy to rank relevant data sources according to user's requirement. First, it applies an attribute based dominant pattern growth (ADP-growth) algorithm to mine the most dominant attributes, and then employs a top-k style ranking algorithm on those attributes to exploit the most relevant data sources with candidate pruning and early termination, which considers the probability of result merging. Further, it improves the algorithm by incorporating relevant attributes based searching strategy to find the data sources, which has been proved of higher efficiency. We have conducted extensive experiments on a real world dataset and demonstrated the efficiency and effectiveness of our approach. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Shen, D., Li, M., Yu, G., Kou, Y., & Nie, T. (2008). Efficient top-k data sources ranking for Query on deep web. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5175 LNCS, pp. 321–336). https://doi.org/10.1007/978-3-540-85481-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free