A third-party replication service for dynamic hidden databases

Author:

Hintzen Stefan,Liesy Yves,Zirpins ChristianORCID

Abstract

AbstractMuch data on the web is available in hidden databases. Users browse their contents by sending search queries to form-based interfaces or APIs. Yet, hidden databases just return the top-k result entries and limit the number of queries per time interval. Such access restrictions constrict those tasks that require many/specific queries or need to access many/all data entries. For a temporary solution, an unrestricted local snapshot can be created by crawling the hidden database. Yet, keeping the snapshot permanently consistent is challenging due to the access restrictions of its origin. In this paper, we propose a replication approach providing permanent unrestricted access to the local copy of a hidden database with dynamic changes. To this end, we present an algorithm to effectively crawl hidden databases that outperforms the state of the art. Furthermore, we propose a new way to continuously control the consistency of the replicated database in an efficient manner. We also introduce the cloud-based architecture of a replication service for hidden databases. We show the effectiveness of the approach through a variety of reproducible experimental evaluations.

Funder

Projekt DEAL

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Management Information Systems,Software

Reference23 articles.

1. Álvarez M, Raposo J, Pan A, Cacheda F, Bellas F, Carneiro V (2007) DeepBot: A focused crawler for accessing hidden web content. In: ACM International Conference Proceeding Series, vol. 236, pp. 18–25. ACM

2. Alwan AA, Ibrahim H, Udzir NI, Sidi F (2013) Estimating missing values of skylines in incomplete database. In: Proceedings of the 2th International Conference on Digital Enterprise and Information Systems, pp. 220–229. SDIWC

3. Asudeh A, Zhang N, Das G (2016) Query reranking as a service. Proceedings of the VLDB Endowment 9(11):888–899

4. Barbosa L, Freire J (2007) An adaptive crawler for locating hiddenwebentry points. In: C.L. Williamson, M.E. Zurko, P.F. Patel-Schneider, P.J. Shenoy (eds.) Proceedings of the 16th international conference on World Wide Web – WWW ’07, p. 441. ACM Press

5. Barbosa L, Freire J (2010) Siphoning hidden-web data through keyword-based interfaces. Journal of Information and Data Management 1(1):133–144

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Publisher Correction to: A third-party replication service for dynamic hidden databases;Service Oriented Computing and Applications;2021-04-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3