Atjaunināt sīkdatņu piekrišanu

Abstraction in Ontology-based Data Management 1 [Mīkstie vāki]

Edited by
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 175,66 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Citas grāmatas par šo tēmu:
Effectively documenting data services is a crucial issue in any organization, not only for governing data but also for interoperation purposes. Indeed, in order to fully realize the promises and benefits of a data-driven society, data-driven approaches need to be resilient, transparent, and fully accountable. This book, Abstraction in Ontology-based Data Management, proposes a new approach to automatically associating formal semantic description to data services, thus bringing them into compliance with the FAIR (Findable, Accessible, Interoperable, and Reusable) guiding principles. The approach is founded on the Ontology-based Data Management (OBDM) paradigm, in which a domain ontology is used to provide a high-level semantic layer mapped to the source schema of an organization containing data, thus abstracting from the technical details of the data layer implementation. A formal framework for a novel reasoning task in OBDM, called Abstraction, is introduced in which a data service is assumed to be expressed as a query over the source schema, and the aim is to derive a query over the ontology that semantically describes the given data service best with respect to the underlying OBDM specification. In a general scenario that uses the most popular languages in the OBDM literature, an in-depth complexity analysis of two computational problems associated with the framework is carried out. Also investigated is the problem of expressing abstractions in a non-monotonic query language as well as the impact of adding inequalities. Regarding the latter, the problem of answering queries with inequalities over lightweight ontologies is first studied. Lastly, the author illustrates how the achieved results contribute to new results in the Semantic Web context and in the Relational Database theory. The book will be of interest to all those engaged in Artificial Intelligence and Data Management.
Chapter 1 Introduction
1(14)
1.1 Contributions of the Thesis
6(6)
1.2 Structure of the Thesis
12(3)
Chapter 2 Theoretical Background
15(22)
2.1 Relational Databases
15(1)
2.2 Query Languages and Homomorphism
15(3)
2.3 Computational Complexity
18(1)
2.4 View-based Query Processing
19(3)
2.5 Description Logic Ontologies and Knowledge Bases
22(8)
2.6 Ontology-based Data Management
30(7)
Chapter 3 Abstraction in Ontology-based Data Management: Framework
37(16)
3.1 The notion of Source-to-Ontology Rewriting
37(4)
3.2 Computational Problems
41(1)
3.3 Related Work
42(11)
Chapter 4 Dealing with Inequalities in Lightweight Description Logics
53(52)
4.1 The Chase for Answering Queries with Inequalities
57(3)
4.2 Answering CQ≠,b over DL-LiteR knowledge bases
60(8)
4.3 Answering UCQ≠,bS over DL-LiteR knowledge bases
68(13)
4.4 Answering UCQ≠,S over DL-LiteRDFS knowledge bases
81(8)
4.5 Answering UCQ1≠,S over DL-LiteRDFS knowledge bases
89(6)
4.6 Containment of UCQ≠,S in Relational Databases
95(10)
Chapter 5 Complete Source-to-Ontology Rewritings
105(20)
5.1 Verification Problem
105(3)
5.2 Computation Problem
108(6)
5.3 Improving by means of Inequalities
114(7)
5.4 Dropping the UNA
121(4)
Chapter 6 Sound Source-to-Ontology Rewritings
125(30)
6.1 Verification Problem
125(5)
6.2 Computation Problem
130(25)
Chapter 7 Perfect Source-to-Ontology Rewritings
155(4)
7.1 Verification Problem
155(1)
7.2 Computation Problem
156(3)
Chapter 8 Sound Source-to-Ontology Rewritings in Restricted Scenarios
159(38)
8.1 Restricted Scenario for UCQJFEs
164(14)
8.2 Restricted Scenario for CQJFEs
178(13)
8.3 Disjunctive Views in View-based Query Processing
191(6)
Chapter 9 Non-Monotonic Source-to-Ontology Rewritings
197(36)
9.1 Towards EQL-Lite(UCQ) Abstractions
199(6)
9.2 Non-existence of EQL-Lite(UCQ) S-to-0 Rewritings
205(7)
9.3 S-to-O Rewritings in a fragment of EQL-Lite(UCQ)
212(8)
9.4 The case of One-To-One Mappings
220(13)
Chapter 10 Conclusions
233(6)
10.1 Discussion
233(2)
10.2 Future Work
235(4)
Bibliography 239