Skip to main content

2014 | Buch

Reasoning Web. Reasoning on the Web in the Big Data Era

10th International Summer School 2014, Athens, Greece, September 8-13, 2014. Proceedings

herausgegeben von: Manolis Koubarakis, Giorgos Stamou, Giorgos Stoilos, Ian Horrocks, Phokion Kolaitis, Georg Lausen, Gerhard Weikum

Verlag: Springer International Publishing

Buchreihe : Lecture Notes in Computer Science

insite
SUCHEN

Über dieses Buch

This volume contains the lecture notes of the 10th Reasoning Web Summer School 2014, held in Athens, Greece, in September 2014. In 2014, the lecture program of the Reasoning Web introduces students to recent advances in big data aspects of semantic web and linked data, and the fundamentals of reasoning techniques that can be used to tackle big data applications.

Inhaltsverzeichnis

Frontmatter

Linked Open Data

Introduction to Linked Data and Its Lifecycle on the Web
Abstract
With Linked Data, a very pragmatic approach towards achieving the vision of the Semantic Web has gained some traction in the last years. The term Linked Data refers to a set of best practices for publishing and interlinking structured data on the Web. While many standards, methods and technologies developed within by the Semantic Web community are applicable for Linked Data, there are also a number of specific characteristics of Linked Data, which have to be considered. In this article we introduce the main concepts of Linked Data. We present an overview of the Linked Data life-cycle and discuss individual approaches as well as the state-of-the-art with regard to extraction, authoring, linking, enrichment as well as quality of Linked Data. We conclude the chapter with a discussion of issues, limitations and further research and development challenges of Linked Data. This article is an updated version of a similar lecture given at Reasoning Web Summer School 2013.
Axel-Cyrille Ngonga Ngomo, Sören Auer, Jens Lehmann, Amrapali Zaveri
An Introduction to Question Answering over Linked Data
Abstract
While the amount of knowledge available as linked data grows, so does the need for providing end users with access to this knowledge. Especially question answering systems are receiving much interest, as they provide intuitive access to data via natural language and shield end users from technical aspects related to data modelling, vocabularies and query languages. This tutorial gives an introduction to the rapidly developing field of question answering over linked data. It gives an overview of the main challenges involved in the interpretation of a user’s information need expressed in natural language with respect to the data that is queried. The paper summarizes the main existing approaches and systems including available tools and resources, benchmarks and evaluation campaigns. Finally, it lists the open topics that will keep question answering over linked data an exciting area of research in the years to come.
Christina Unger, André Freitas, Philipp Cimiano

RDF and Graph Databases

Query Processing for RDF Databases
Abstract
RDF has become recently a very popular data model used in a variety of applications and use cases in both academia and industry. Query processing and evaluation is a central component in data management in general and is, thus, unsurprisingly one of the most active areas of research in the field of RDF data management. In this chapter we provide an overview of query processing techniques for the RDF data model using different system architectures. We survey techniques for both centralized and distributed RDF stores, including peer-to-peer, federated and cloud-based systems.
Zoi Kaoudi, Anastasios Kementsietsidis
Introduction to Graph Databases
Abstract
The use of graphs in analytic environments is getting more and more widespread, with applications in many different environments like social network analysis, fraud detection, industrial management, knowledge analysis, etc. Graph databases are one important solution to consider in the management of large datasets. The course will be oriented to tackle four important aspects of graph management. First, to give a characterization of graphs and the most common operations applied on them. Second, to review the technologies for graph management and focus on the particular case of Sparksee. Third, to analyze in depth some important applications and how graphs are used to solve them. Fourth, to understand the use of benchmarking to make the requirements of the user compatible with the growth of the technologies for graph management.
Josep Lluís Larriba-Pey, Norbert Martínez-Bazán, David Domínguez-Sal

Description Logic Based Ontologies

An Introduction to Description Logics and Query Rewriting
Abstract
This chapter gives an overview of the description logics underlying the OWL 2 Web Ontology Language and its three tractable profiles, OWL2 RL, OWL2EL and OWL 2QL. We consider the syntax and semantics of these description logics as well as main reasoning tasks and their computational complexity.We also discuss the semantical foundations for first-order and datalog rewritings of conjunctive queries over knowledge bases given in the OWL2 profiles, and outline the architecture of the ontology-based data access system Ontop.
Roman Kontchakov, Michael Zakharyaschev
An Introduction to Ontology-Based Query Answering with Existential Rules
Abstract
The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit ontological knowledge, has been acknowledged in the database, knowledge representation and Semantic Web communities. We focus here on the ontology-based data querying problem, which consists in querying data while taking ontological knowledge into account. To tackle this problem, we consider a logical framework based on existential rules, also called Datalog±.
In this course, we introduce fundamental notions on ontology-based query answering with existential rules. We present basic reasoning techniques, explain the relationships with other formalisms such as lightweight description logics, and review decidability results as well as associated algorithms. We end with ongoing research and some challenging issues.
Marie-Laure Mugnier, Michaël Thomazo
Ontology Based Data Access on Temporal and Streaming Data
Abstract
Though processing time-dependent data has been investigated for a long time, the research on temporal and especially stream reasoning over linked open data and ontologies is reaching its high point these days. In this tutorial, we give an overview of state-of-the art query languages and engines for temporal and stream reasoning. On a more detailed level, we discuss the new language STARQL (Reasoning-based Query Language for Streaming and Temporal ontology Access). STARQL is designed as an expressive and flexible stream query framework that offers the possibility to embed different (temporal) description logics as filter query languages over ontologies, and hence it can be used within the OBDA paradigm (Ontology Based Data Access in the classical sense) and within the ABDEO paradigm (Accessing Big Data over Expressive Ontologies).
Özgür Lütfü Özçep, Ralf Möller

Applications

Querying and Learning in Probabilistic Databases
Abstract
Probabilistic Databases (PDBs) lie at the expressive intersection of databases, first-order logic, and probability theory. PDBs employ logical deduction rules to process Select-Project-Join (SPJ) queries, which form the basis for a variety of declarative query languages such as Datalog, Relational Algebra, and SQL. They employ logical consistency constraints to resolve data inconsistencies, and they represent query answers via logical lineage formulas (aka.“data provenance”) to trace the dependencies between these answers and the input tuples that led to their derivation. While the literature on PDBs dates back to more than 25 years of research, only fairly recently the key role of lineage for establishing a closed and complete representation model of relational operations over this kind of probabilistic data was discovered. Although PDBs benefit from their efficient and scalable database infrastructures for data storage and indexing, they couple the data computation with probabilistic inference, the latter of which remains a #P-hard problem also in the context of PDBs.
In this chapter, we provide a review on the key concepts of PDBs with a particular focus on our own recent research results related to this field. We highlight a number of ongoing research challenges related to PDBs, and we keep referring to an information extraction (IE) scenario as a running application to manage uncertain and temporal facts obtained from IE techniques directly inside a PDB setting.
Maximilian Dylla, Martin Theobald, Iris Miliaraki
Semantic and Reasoning Systems for Cities and Citizens
Abstract
The Semantic Web is finally leaving the lab. In this article, we examine some practical, industry-oriented Semantic Web systems and discuss the costs and benefits on this disruptive technology. We focus on applications for cities and citizens and present a set of key challenges and solutions made possible using semantics at scale. When applicable, we report on the differentiating factors for Semantic Technologies, showcasing their unique capabilities, as well as the cost of this paradigm shift.
Spyros Kotoulas
Backmatter
Metadaten
Titel
Reasoning Web. Reasoning on the Web in the Big Data Era
herausgegeben von
Manolis Koubarakis
Giorgos Stamou
Giorgos Stoilos
Ian Horrocks
Phokion Kolaitis
Georg Lausen
Gerhard Weikum
Copyright-Jahr
2014
Verlag
Springer International Publishing
Electronic ISBN
978-3-319-10587-1
Print ISBN
978-3-319-10586-4
DOI
https://doi.org/10.1007/978-3-319-10587-1

Premium Partner