PLP
Ippokratis Pandis, Pınar Tözün, Ryan Johnson et al. · Proceedings of the VLDB Endowment · 2011
Scaling the performance of shared-everything transaction processing systems to highly-parallel multicore hardware remains a challenge for database system designers. Recent proposals alleviate locking and logging bottlenecks in the system, leaving page latching as the next potential problem. To tackle the page latching problem, we propose physiological partitioning (PLP). The PLP design applies logical-only partitioning, maintaining the desired properties of shared-everything designs, and introduces a multi-rooted B+Tree index structure (MRBTree) which enables the partitioning of the accesses at the physical page level. Logical partitioning and MRBTrees together ensure that all accesses to a given index page come from a single thread and, hence, can be entirely latch-free; an extended design makes heap page accesses thread-private as well. Eliminating page latching allows us to simplify key code paths in the system such as B+Tree operations leading to more efficient and maintainable code. Profiling a prototype PLP system running on different multicore machines shows that it acquires 85% and 68% fewer contentious critical sections, respectively, than an optimized conventional design and one based on logical-only partitioning. PLP also improves performance up to 40% and 18%, respectively, over the existing systems.
Cited by 75 works. doi:10.14778/2021017.2021019
Authors
References
- The Gamma database machine project
- The Case for Shared Nothing.
- Organization and maintenance of large ordered indices
- Towards robust distributed systems (abstract)
- The end of an architectural era: (it's time for a complete rewrite)
- Amdahl's Law in the Multicore Era
- OLTP through the looking glass, and what we found there
- Managing Wire Delay in Large Chip-Multiprocessor Caches
- Schism
- ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes