In the database context, the hypertree decomposition method is used for query optimization,
whereby conjunctive queries having a low degree of cyclicity can be recognized and …

As recently as the 1990s, studies showed that most people preferred getting information
from other people rather than from information retrieval systems. Of course, in that time …

Data mining is the discovery of interesting, unexpected or valuable structures in large
datasets. As such, it has two rather different aspects. One of these concerns large …

The ability to handle large scale graph data is crucial to an increasing number of
applications. Much work has been dedicated to supporting basic graph operations such as …

Transactional Information Systems is the long-awaited, comprehensive work from leading
scientists in the transaction processing field. Weikum and Vossen begin with a broad look at …

Spatial Databases is the first unified, in-depth treatment of special techniques for dealing
with spatial data, particularly in the field of geographic information systems (GIS). This book …

This paper explores the design space of MMU caches that accelerate virtual-to-physical
address translation in processor architectures, such as x86-64, that use a radix tree page …

Relational joins are at the core of relational algebra, which in turn is the core of the standard
database query language SQL. As their evaluation is expensive and very often dominated …

We study fundamental aspects related to the efficient processing of the SPARQL query
language for RDF, proposed by the W3C to encode machine-readable information in the …

Social professional networks provide features not available in other networks. For example,
LinkedIn and AngelList facilitate professional networking, and GitHub enables committing …