We present the BB-Tree, a fast and space-efficient index structure for processing
multidimensional workloads in main memory. It uses a k-ary search tree for pruning and …

Index structures are powerful tools for improving query performance and reducing disk
access in database systems. Multi-dimensional indexes, in particular, are used to filter …

Searching in sorted arrays of keys is a common task with a broad range of applications.
Often searching is part of the performance critical sections of a database query or index …

Many database applications, such as OnLine Analytical Processing (OLAP), web-based
information extraction or scientific computation, need to select a subset of fields based on …

Efficient evaluation of selection predicates is a performance-critical task, for instance to
reduce intermediate result sizes being the input for further operations. With analytical …

The increasing heterogeneity of the underlying hardware forces modern database system
engineers to implement multiple variants of a single database operator (eg, join, selection) …

After the introduction of Persistent Memory in the form of Intel's Optane DC Persistent
Memory on the market in 2019, it has found its way into manifold applications and systems …

Reproducibility and generalizability are important criteria for today's data management
society. Hence, stand-alone solutions that work well in isolation, but cannot convince at …

Index structures designed for disk-based database systems do not fulfill the requirements for
modern database systems. To improve the performance of these index structures, different …

Ever-since, database system engineers are striving for peak performance of their database
operators. However, this goal is a major endeavor since database operators are influenced …