首页> 外文会议>Web Information Systems Engineering- WISE 2008 >Efficient Top-k Data Sources Ranking for Query on Deep Web
【24h】

Efficient Top-k Data Sources Ranking for Query on Deep Web

机译:在Deep Web上进行查询的高效Top-k数据源排名

获取原文
获取原文并翻译 | 示例

摘要

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, 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.
机译:由于大量的深层Web数据源,在深层Web上进行高效的查询处理已变得越来越重要。尽管如此,如何在深层网络中发现最相关的数据源仍然是一个具有挑战性的问题。受到深层网络观察的启发,本文提出了一种新颖的top-k排名策略,可根据用户需求对相关数据源进行排名。首先,它应用基于属性的显性模式增长(ADP-growth)算法来挖掘最显性的属性,然后对这些属性采用top-k样式排名算法,以利用候选修剪和提前终止来开发最相关的数据源,从而考虑结果合并的可能性。此外,它通过结合基于相关属性的搜索策略来查找数据源来改进算法,这已被证明具有更高的效率。我们在现实世界的数据集上进行了广泛的实验,并证明了我们方法的有效性和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号