1,137 research outputs found
Storage Management with Multi-Version Partitioned B-Trees
Database Management Systems and K/V-Stores operate on updatable datasets --
massively exceeding the size of available main memory. Tree-based K/V storage
management structures became particularly popular in storage engines. B+ Trees
allow constant search performance, however write-heavy workloads yield in
inefficient write patterns to secondary storage devices and poor performance
characteristics. LSM-Trees overcome this issue by horizontal partitioning
fractions of data - small enough to fully reside in main memory, but require
frequent maintenance to sustain search performance.
Firstly, we propose Multi-Version Partitioned BTrees (MV-PBT) as sole storage
and index management structure in key-sorted storage engines like K/V-Stores.
Secondly, we compare MV-PBT against LSM-Trees. The logical horizontal
partitioning in MV-PBT allows leveraging recent advances in modern B-Tree
techniques in a small transparent and memory resident portion of the structure.
Structural properties sustain steady read performance, yielding efficient write
patterns and reducing write amplification.
We integrated MV-PBT in the WiredTiger KV storage engine. MV-PBT offers an up
to 2x increased steady throughput in comparison to LSM-Trees and several orders
of magnitude in comparison to B+ Trees in a YCSB workload.Comment: Extended Version, ADBIS 202
Infections with Ehrlichia canis and Borrelia burgdorferi in a dog
A clinical case of Ehrlichia canis and Borrelia burgdorferi infections in a 5year-old male German Shepherd is described. Clinical, serological, necropsy and histopathological examinations supporting the diagnosis have been performed
bloomRF: On Performing Range-Queries in Bloom-Filters with Piecewise-Monotone Hash Functions and Prefix Hashing
We introduce bloomRF as a unified method for approximate membership testing
that supports both point- and range-queries. As a first core idea, bloomRF
introduces novel prefix hashing to efficiently encode range information in the
hash-code of the key itself. As a second key concept, bloomRF proposes novel
piecewise-monotone hash-functions that preserve local order and support fast
range-lookups with fewer memory accesses. bloomRF has near-optimal space
complexity and constant query complexity. Although, bloomRF is designed for
integer domains, it supports floating-points, and can serve as a
multi-attribute filter. The evaluation in RocksDB and in a standalone library
shows that it is more efficient and outperforms existing point-range-filters by
up to 4x across a range of settings and distributions, while keeping the
false-positive rate low.Comment: Extended version. Original accepted at EDBT 202
AnyDB: An Architecture-less DBMS for Any Workload
In this paper, we propose a radical new approach for scale-out distributed
DBMSs. Instead of hard-baking an architectural model, such as a shared-nothing
architecture, into the distributed DBMS design, we aim for a new class of
so-called architecture-less DBMSs. The main idea is that an architecture-less
DBMS can mimic any architecture on a per-query basis on-the-fly without any
additional overhead for reconfiguration. Our initial results show that our
architecture-less DBMS AnyDB can provide significant speed-ups across varying
workloads compared to a traditional DBMS implementing a static architecture.Comment: Submitted to 11th Annual Conference on Innovative Data Systems
Research (CIDR 21
Effective DMBS space management on native Flash
In this paper we build on our research in data management on native Flash storage. In particular we demonstrate the advantages of intelligent data placement strategies. To effectively manage phsical Flash space and organize the data on it, we utilize novel storage structures such as regions and groups. These are coupled to common DBMS logical structures, thus require no extra overhead for the DBA. The experimental results indicate an improvement of up to 2x, which doubles the longevity of Flash SSD. During the demonstration the audience can experience the advantages of the proposed approach on real Flash hardware
- …