B-trees are the go-to data structure for in-memory indexes in databases and storage
systems. B-trees support both point operations (ie, inserts and finds) and range operations …

Many new memory indexing structures have been proposed and outperform current in-
memory skip-list index adopted by LevelDB, RocksDB and other key-value systems …

Indexing large-scale databases in main memory is still challenging today. Learned index
structures--in which the core components of classical indexes are replaced with machine …

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 …

Data stream processing systems enable querying over sliding windows of streams of data.
Efficient index structures for the streaming window are a crucial building block to enable …

Computed AM-FM models represent images in terms of instantaneous amplitude and
frequency modulations. However, the instantaneous amplitude and frequency of a real …

We propose a design for a fine-grained lock-based skiplist optimized for Graphics
Processing Units (GPUs). While GPUs are often used to accelerate streaming parallel …

Diese Dissertation beschreibt das Design und die Implementierung eines effizienten
Suchsystems für linguistische Korpora. Das bestehende und auf einer relationalen …

Modern out-of-order processors have increased capacity to exploit instruction level
parallelism (ILP) and memory level parallelism (MLP), eg, by using wide superscalar …

The end-to-end lookup latency of a hierarchical index---such as a B-tree or a learned index---
is determined by its structure such as the number of layers, the kinds of branching functions …