RDF has seen increased adoption in recent years, prompting the standardization of the
SPARQL query language for RDF, and the development of local and distributed engines for …

Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …

Abstract The famous Burrows–Wheeler Transform (BWT) was originally defined for a single
string but variations have been developed for sets of strings, labeled trees, de Bruijn graphs …

We present an indexing scheme that supports worst-case optimal (wco) joins over graphs
within compact space. Supporting all possible wco joins using conventional data structures …

RDF triplestores' ability to store and query knowledge bases augmented with semantic
annotations has attracted the attention of both research and industry. A multitude of systems …

The dynamicity of RDF data has motivated the development of solutions for archiving, ie, the
task of storing and querying previous versions of an RDF dataset. Querying the history of a …

Abstract When publishing Linked Open Datasets on the Web, most attention is typically
directed to their latest version. Nevertheless, useful information is present in or between …

The volume of published linked open datasets in RDF format is growing exponentially in the
last decades. With this continuous proliferation of this growth, demands for managing …

The flexible paradigm of Resource Description Framework (RDF) has accelerated the raw
data published on the web. Therefore, the volume of generated RDF data has increased …

We address the problem of storing and analyzing large datasets of passenger trips over
public transportation networks that are of interest to network administrators trying to balance …