Downloading textual hidden web content through keyword queries

A. Ntoulas, P. Zerfos, Junghoo Cho
{"title":"Downloading textual hidden web content through keyword queries","authors":"A. Ntoulas, P. Zerfos, Junghoo Cho","doi":"10.1145/1065385.1065407","DOIUrl":null,"url":null,"abstract":"An ever-increasing amount of information on the Web today is available only through search interfaces: the users have to type in a set of keywords in a search form in order to access the pages from certain Web sites. These pages are often referred to as the hidden Web or the deep Web. Since there are no static links to the hidden Web pages, search engines cannot discover and index such pages and thus do not return them in the results. However, according to recent studies, the content provided by many hidden Web sites is often of very high quality and can be extremely valuable to many users. In this paper, we study how we can build an effective hidden Web crawler that can autonomously discover and download pages from the hidden Web. Since the only \"entry point\" to a hidden Web site is a query interface, the main challenge that a hidden Web crawler has to face is how to automatically generate meaningful queries to issue to the site. We provide a theoretical framework to investigate the query generation problem for the hidden Web and we propose effective policies for generating queries automatically. Our policies proceed iteratively, issuing a different query in every iteration. We experimentally evaluate the effectiveness of these policies on 4 real hidden Web sites and our results are very promising. For instance, in one experiment, one of our policies downloaded more than 90% of a hidden Web site (that contains 14 million documents) after issuing fewer than 100 queries","PeriodicalId":248721,"journal":{"name":"Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"236","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1065385.1065407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 236

Abstract

An ever-increasing amount of information on the Web today is available only through search interfaces: the users have to type in a set of keywords in a search form in order to access the pages from certain Web sites. These pages are often referred to as the hidden Web or the deep Web. Since there are no static links to the hidden Web pages, search engines cannot discover and index such pages and thus do not return them in the results. However, according to recent studies, the content provided by many hidden Web sites is often of very high quality and can be extremely valuable to many users. In this paper, we study how we can build an effective hidden Web crawler that can autonomously discover and download pages from the hidden Web. Since the only "entry point" to a hidden Web site is a query interface, the main challenge that a hidden Web crawler has to face is how to automatically generate meaningful queries to issue to the site. We provide a theoretical framework to investigate the query generation problem for the hidden Web and we propose effective policies for generating queries automatically. Our policies proceed iteratively, issuing a different query in every iteration. We experimentally evaluate the effectiveness of these policies on 4 real hidden Web sites and our results are very promising. For instance, in one experiment, one of our policies downloaded more than 90% of a hidden Web site (that contains 14 million documents) after issuing fewer than 100 queries
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过关键字查询下载文本隐藏的web内容
如今,网络上越来越多的信息只能通过搜索界面获取:用户必须在搜索表单中输入一组关键字,才能从某些网站访问页面。这些页面通常被称为隐藏网络或深层网络。由于没有指向隐藏Web页面的静态链接,搜索引擎无法发现和索引这些页面,因此不会在结果中返回它们。然而,根据最近的研究,许多隐藏网站提供的内容通常质量非常高,对许多用户来说可能非常有价值。在本文中,我们研究了如何构建一个有效的隐藏网络爬虫,它可以自主地从隐藏网络中发现和下载页面。由于隐藏Web站点的唯一“入口点”是查询接口,因此隐藏Web爬虫必须面对的主要挑战是如何自动生成要向站点发出的有意义的查询。我们提供了一个理论框架来研究隐藏Web的查询生成问题,并提出了有效的自动生成查询的策略。我们的策略迭代地进行,在每次迭代中发出不同的查询。我们在4个真实的隐藏网站上实验评估了这些策略的有效性,结果非常有希望。例如,在一个实验中,我们的一个策略在发出不到100次查询后,下载了一个隐藏网站(包含1400万份文档)90%以上的内容
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Interviews with NSDL grantees on core values and service perspectives Evaluating G-portal for geography learning and teaching Building preservation environments Measuring the quality of network visualization E-library of medieval chant manuscript transcriptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1