Name
Abstract | ||
|---|---|---|
Database Management Systems (DBMS) need to handle large updatable datasets in on-line transaction processing (OLTP) workloads. Most modern DBMS provide snapshots of data in multi-version concurrency control (MVCC) transaction management scheme. Each transaction operates on a snapshot of the database, which is calculated from a set of tuple versions. High parallelism and resource-efficient append-only data placement on secondary storage is enabled. One major issue in indexing tuple versions on modern hardware technologies is the high write amplification for tree-indexes.
Partitioned B-Trees (PBT) [5] is based on the structure of the ubiquitous B+-Tree [8]. They achieve a near optimal write amplification and beneficial sequential writes on secondary storage. Yet they have not been implemented in a MVCC enabled DBMS to date.
In this paper we present the implementation of PBTs in PostgreSQL extended with SIAS. Compared to PostgreSQL's B+-Trees PBTs have 50% better transaction throughput under TPC-C and a 30% improvement to standard PostgreSQL with Heap-Only Tuples.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3331076.3331118 | Proceedings of the 23rd International Database Applications & Engineering Symposium |
Keywords | DocType | ISBN |
MVCC, indexing structure, modern storage hardware | Conference | 978-1-4503-6249-8 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Riegger | 1 | 3 | 3.77 |
| Tobias Vinçon | 2 | 4 | 7.51 |
| Ilia Petrov | 3 | 83 | 20.20 |