Write-optimized indexing with partitioned B-trees
- Database management systems (DBMS) are critical performance components in large scale applications under modern update intensive workloads. Additional access paths accelerate look-up performance in DBMS for frequently queried attributes, but the required maintenance slows down update performance. The ubiquitous B+ tree is a commonly used key-indexed access path that is able to support many required functionalities with logarithmic access time to requested records. Modern processing and storage technologies and their characteristics require reconsideration of matured indexing approaches for today's workloads. Partitioned B-trees (PBT) leverage characteristics of modern hardware technologies and complex memory hierarchies as well as high update rates and changes in workloads by maintaining partitions within one single B+-Tree. This paper includes an experimental evaluation of PBTs optimized write pattern and performance improvements. With PBT transactional throughput under TPC-C increases 30%; PBT results in beneficial sequential write patterns even in presence of updates and maintenance operations.
| Author of HS Reutlingen | Riegger, Christian; Petrov, Ilia |
|---|---|
| DOI: | https://doi.org/10.1145/3151759.3151814 |
| ISBN: | 978-1-4503-5299-4 |
| Erschienen in: | iiWAS '17 : Proceedings of the 19th International Conference on Information Integration and Web-based Applications & Services ; Salzburg, Austria, December 04 - 06, 2017 |
| Publisher: | Association for Computing Machinery |
| Place of publication: | New York, NY |
| Document Type: | Conference proceeding |
| Language: | English |
| Publication year: | 2017 |
| Page Number: | 5 |
| DDC classes: | 004 Informatik |
| Open access?: | Nein |
| Licence (German): |  In Copyright - Urheberrechtlich geschützt |
