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 …

Storing and processing of large DNA sequences has always been a major problem due to
increasing volume of DNA sequence data. However, a number of solutions have been …

In this paper we focus on representing Web and social graphs. Our work is motivated by the
need of mining information out of these graphs, thus our representations do not only aim at …

We introduce a dynamic data structure for the compact representation of binary relations R⊆
A× B. The data structure is a dynamic variant of the k 2-tree, a static compact representation …

Word-based byte-oriented compression has succeeded on large natural language text
databases, by providing competitive compression ratios, fast random access, and direct …

Mining and analyzing large web and social networks are challenging tasks in terms of
storage and information access. In order to address this problem, several works have …

Motivated by the needs of mining and advanced analysis of large Web graphs and social
networks, we study graph patterns that simultaneously provide compression and query …

A raster time series is a sequence of independent rasters arranged chronologically covering
the same geographical area. These are commonly used to depict the temporal evolution of …

We introduce a dynamic data structure for the compact representation of binary relations R?
A× B. Apart from checking whether two objects (a, b)? A× B are related, and listing the …

In this thesis we study the efficient representation of multidimensional grids, presenting new
compact data structures to store and query grids in different application domains. We …