We survey foundational features underlying modern graph query languages. We first
discuss two popular graph data models: edge-labelled graphs, where nodes are connected …

Graph database models can be defined as those in which data structures for the schema
and instances are modeled as graphs or generalizations of them, and data manipulation is …

We present the framework of ontology-based data access, a semantic paradigm for
providing a convenient and user-friendly access to data repositories, which has been …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Description Logics are a family of knowledge representation languages that have been
studied extensively in Artificial Intelligence over the last two decades. They are embodied in …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

This database theory book provides a focused presentation of the core material on relational
databases, and presents a number of advanced topics in a unified framework. Some of the …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

Probabilistic databases are databases where the value of some attributes or the presence of
some records are uncertain and known only with some probability. Applications in many …

The classical theory of computation has its origins in the work of Goedel, Turing, Church,
and Kleene and has been an extraordinarily successful framework for theoretical computer …