LIQUID: Logic-based Integration and Querying of Unindexed Internet Data

LIQUID：未索引互联网数据的基于逻辑的集成和查询

• 批准号: EP/L003260/1
• 负责人: Andrea Cali
• 金额: $ 11.4万
• 依托单位: Birkbeck, University of London
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2013
• 资助国家: 英国
• 起止时间: 2013 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FL003260%2F1
• 关键词: LIQUID; Logic; based; Integration; Querying

The Deep Web is constituted by data that are stored outside web pages, normallyin databases or files, and are accessible by querying them through web forms.Deep Web data sources, apart from having local integrity constraints enforcedon them, are characterised by so-called access limitations, due to the inputrequirements of the forms, and such limitations restrict the set of that thatcan be ``reached'' by queries. Moreover, in general, recursive query plans areneeded to provide the maximum information as answer to a query. In the projectLIQUID (Logic-based Integration of Unindexed Internet Data), we address theproblem of integrating Deep Web sources and making them queryable through aglobal schema, representing all underlying data. The global schema employsconstraints to model properties of the domain of interest, which are notnecessarily reflected by the data stored at the heterogeneous sources. In thisproject we plan to study formalisms to represent Deep Web integration systems,and to devise scalable query processing techniques for such systems. We planto study static and dynamic techniques to reduce the query processing cost, byemploying logic-based reasoning techniques on constraints and accesslimitations. We plan to build a prototype implementing our findings. LIQUIDwill face ambitious challenges, due to the variety of formalisms and problemsinto play.

Deep Web由存储在网页之外的数据组成，通常存储在数据库或文件中，并且可以通过Web表单查询它们来访问。Deep Web数据源除了具有本地完整性约束外，还具有所谓的访问限制，这是由于表单的输入要求，并且这种限制限制了查询可以“到达”的集合。此外，一般来说，递归查询计划需要提供最大的信息作为查询的答案。在项目LIQUID（Logic-based Integration of Unindexed Internet Data）中，我们解决了集成Deep Web源的问题，并使它们通过agreement schema可查询，表示所有底层数据。全局模式使用约束来对感兴趣领域的属性进行建模，这些属性不一定被存储在异构源中的数据所反映。在这个项目中，我们计划研究表示Deep Web集成系统的形式主义，并为此类系统设计可扩展的查询处理技术。我们计划研究静态和动态的技术，以减少查询处理成本，通过采用基于逻辑的推理技术的约束和访问限制。我们计划建立一个原型来实现我们的发现。由于形式主义和问题的多样性，可持续发展将面临巨大的挑战。

项目成果

Semantic Search in RealFoodTrade

• 发表时间: 2014-07
• 作者: A. Calí;R. D. Virgilio;T. D. Noia;L. Menichetti;R. Mirizzi;L. Nardini;V. Ostuni;Fabrizio Rebecca;Marco Ungania

Keyword Search in the Deep Web.

深网中的关键字搜索。

• 发表时间: 2015
• 作者: Andrea Cali

Query Answering on Expressive Datalog+/- Ontologies

表达数据记录/本体的查询回答

• 发表时间: 2016
• 作者: Bertossi L

Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management

第九届阿尔贝托·门德尔松数据管理基础国际研讨会论文集

• 发表时间: 2015
• 作者: Andrea Cali

Non-FPT lower bounds for structural restrictions of decision DNNF

决策 DNNF 的结构限制的非 FPT 下限

• DOI: 10.48550/arxiv.1708.07767
• 发表时间: 2017
• 期刊: arXiv e-prints
• 作者: Cal