Despite the wide adoption of graph processing across many different application domains,
there is no underlying data structure that can serve a variety of graph workloads (analytics …

Index structures are a building block of query processing and computer science in general.
Since the dawn of computer technology there have been index structures. And since then, a …

Persistent Memory (PM) represents a very promising, next-generation memory solution with
a significant impact on database architectures. Several data structures for this new …

There is significant interest in examining large datasets using complex domain-specific
queries. In many cases, these queries can be accelerated using specialized indexes …

We present XIndex, which is a concurrent index library and designed for fast queries. It
includes a concurrent ordered index (XIndex-R) and a concurrent hash index (XIndex-H) …

LSM-Trees and B-Trees are the two primary data structures used as storage engines in
modern key-value (KV) stores. These two structures are optimal for different workloads; LSM …

Index structures are a building block of query processing and computer science in general.
Since the dawn of computer technology there have been index structures. And since then, a …

Key-value stores are ubiquitous at all layers of the computational stack; offering constant
average lookup, insertion, and deletion time. This dissertation looks at how we can exploit …