Query-driven Data Acquisition from Web-based Data Sources

从基于 Web 的数据源进行查询驱动的数据采集

• 批准号: EP/H017690/1
• 负责人: Michael Benedikt
• 金额: $ 63.59万
• 依托单位: University of Oxford
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2010
• 资助国家: 英国
• 起止时间: 2010 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FH017690%2F1
• 关键词: Query; driven; Data; Acquisition; Web

The functioning of entities as diverse as enterprises and government agencies depends onobtaining high-quality data.Increasingly these entities depend on external sourcesfor their operational data: critical datais obtained dynamically via web services, is extracted from web pages,or is purchased from third parties. These sources can differ radicallyin their completeness, accuracy, and availability. It is not possible for applications to indexand explore data from each source in advance of querying:there are too many sources, they are too costly to access, and the data in themmay be refreshed constantly. How should data acquisition proceed in such situations?In this project we will develop algorithms for answering queries in the presence of large numbers ofweb-based data sources, sources that may overlap substantially in their datasetsbut have different access restrictions and costs. Our approach will make use of schema information about thedata an application is querying: data format, integrity constraints, and any prior knowledge of costs that maybe available. The core of the project will be algorithms for answering a query by interactively exploring the sources,dynamically pruning out irrelevant or exhausted sources in the process.

企业和政府机构等各种实体的运作取决于获得高质量的数据。这些实体越来越依赖外部来源获取其运营数据：关键数据是通过 Web 服务动态获取、从网页中提取或从第三方购买的。这些来源在完整性、准确性和可用性方面可能存在根本差异。应用程序不可能在查询之前对每个源的数据进行索引和探索：源太多，访问成本太高，并且其中的数据可能会不断刷新。在这种情况下应该如何进行数据采集？在这个项目中，我们将开发在存在大量基于网络的数据源的情况下回答查询的算法，这些数据源可能在其数据集中大量重叠，但具有不同的访问限制和成本。我们的方法将利用有关应用程序正在查询的数据的模式信息：数据格式、完整性约束以及可能可用的成本的任何先验知识。该项目的核心将是通过交互式探索源来回答查询的算法，在此过程中动态修剪掉不相关或耗尽的源。

项目成果

Finite Open-World Query Answering with Number Restrictions

具有数量限制的有限开放世界查询应答

• DOI: 10.1109/lics.2015.37
• 发表时间: 2015
• 作者: Amarilli A

The impact of virtual views on containment

虚拟视图对遏制的影响

• DOI: 10.14778/1920841.1920882
• 发表时间: 2010
• 期刊: Proceedings of the VLDB Endowment
• 影响因子: 2.5
• 作者: Benedikt M

The complexity of higher-order queries

高阶查询的复杂度

• DOI: 10.1016/j.ic.2015.07.003
• 发表时间: 2015
• 期刊: Information and Computation
• 影响因子: 1
• 作者: Benedikt M

Some Model Theory of Guarded Negation

防护否定的一些模型理论

• DOI: 10.48550/arxiv.2005.06299
• 发表时间: 2020
• 作者: Barany V

Two Variable vs. Linear Temporal Logic in Model Checking and Games

模型检查和博弈中的二变量与线性时态逻辑

• DOI: 10.2168/lmcs-9(2:4)2013
• 发表时间: 2013
• 期刊: Logical Methods in Computer Science
• 影响因子: 0.6
• 作者: Benedikt M