Abstractions of Queries in Ontology-Based Data Access

2026-06-23 · Source: Artificial Intelligence · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Data Science & Analytics · Depth: Expert, quick

Summary

A recent study on Ontology-Based Data Access (OBDA) investigates query abstraction, a process of translating data queries to the ontology layer for integrating multiple data sources via ontology mappings. The research addresses the challenge that perfect abstractions may not always exist, introducing the concepts of minimally complete and maximally sound abstractions. It proposes an extension of Union of Conjunctive Queries (UCQs) with a limited form of inequality and a special predicate for database constants. This extension is crucial as it allows for the expression of minimally complete abstractions, and thus perfect abstractions when they are possible, without increasing the overall complexity of the problems. Furthermore, the study characterizes maximally sound abstractions by establishing a new connection with the notion of maximum recovery, a concept stemming from data exchange, all within an OBDA framework utilizing existential rules and certain answer semantics.

Key takeaway

For AI Scientists and Database Architects designing Ontology-Based Data Access (OBDA) systems, this research provides a critical advancement in query abstraction. You should consider evaluating the proposed extension of Union of Conjunctive Queries (UCQs) with inequality and database constant predicates. This approach enables expressing minimally complete abstractions, potentially leading to more accurate and comprehensive data integration without increasing computational complexity, and offers a new perspective on achieving maximally sound abstractions through data exchange principles.

Key insights

The paper extends UCQs to express complete query abstractions in OBDA without increasing complexity.

Principles

• Perfect query abstractions may not always exist in OBDA.
• Minimally complete and maximally sound abstractions are key concepts.
• Extending UCQs can express complex abstractions without added complexity.

Method

The method involves extending UCQs with limited inequality and a special predicate to express minimally complete abstractions and characterize maximally sound ones via maximum recovery.

In practice

• Implement extended UCQs for more expressive OBDA query abstraction.
• Consider maximum recovery principles for sound abstraction design.

Topics

• Ontology-Based Data Access
• Query Abstraction
• Union of Conjunctive Queries
• Existential Rules
• Data Exchange
• Database Integration

Best for: Research Scientist, AI Scientist

Related on AIssential

• Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure — A plug-in architecture enables efficient defeasible reasoning and CQ answering for DL-Lite under Rational Closure.
• A Pythonic Functional Approach for Semantic Data Harmonisation in the ILIAD Project — A Pythonic functional approach simplifies semantic data harmonisation by abstracting complex Semantic Web standards into familiar Python functions.
• Formalizing the DATASUS RTS: An Ontological Model for a Resource Description Framework Knowledge Graph — Transforming relational health data into a W3C-compliant knowledge graph improves interoperability and semantic querying.
• The Open World/Closed World Conundrum — The semantic web is shifting from Open World to Closed World Assumptions, driven by practical system demands.
• Semantic Foundations for Reliable Enterprise AI — Semantic clarity in data, achieved through robust data contracts and ontologies, is crucial for reliable enterprise AI outputs.
• Text-to-Cypher for Large Graphs — Automating natural language queries for large graphs significantly improves data access and analytical efficiency.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Artificial Intelligence.