Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Booss

dblp:151/3176 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0005-7664-4501ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 7 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Memory systems · 90% Storage systems · 10%
Databases, data mining, and information retrieval
4 papers
Indexing and storage engines · 49% Database system architecture and tuning · 48% Query processing and optimization · 3%

Topics — the 11 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
main-memory database
0.812024
An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA · Proc. VLDB Endow. 2024
Memory systems › memory disaggregation
CXL memory
0.812024
An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA · Proc. VLDB Endow. 2024
Memory systems
main memory database
0.812024
An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA · Proc. VLDB Endow. 2024
Memory systems
memory disaggregation
0.812024
An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA · Proc. VLDB Endow. 2024
Memory systems
non-volatile memory
0.422017
SAP HANA Adoption of Non-Volatile Memory · Proc. VLDB Endow. 2017
Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems · Proc. VLDB Endow. 2017
Indexing and storage engines › storage management
non-volatile memory integration
0.312017
SAP HANA Adoption of Non-Volatile Memory · Proc. VLDB Endow. 2017
Indexing and storage engines › b+-tree
persistent b+-tree
0.312017
Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems · Proc. VLDB Endow. 2017
Indexing and storage engines
columnar storage
0.212016
Page As You Go: Piecewise Columnar Access In SAP HANA · SIGMOD Conference 2016
Indexing and storage engines › column store
main-memory column store
0.212016
Page As You Go: Piecewise Columnar Access In SAP HANA · SIGMOD Conference 2016
Storage systems › storage reliability
durability
0.112017
SAP HANA Adoption of Non-Volatile Memory · Proc. VLDB Endow. 2017
Memory systems › non-volatile memory
storage class memory
0.112017
Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems · Proc. VLDB Endow. 2017

Methods — techniques the papers use, named apart from their topics

workload characterization · 1.5performance analysis · 1.5defragmentation · 0.6concurrency control · 0.6byte-addressable NVRAM · 0.6run-length encoding · 0.2order-preserving dictionary · 0.2inverted index · 0.2
YearPublicationVenuePosition
2024 An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA
abstract
CXL-based disaggregated memory systems offer options to expand the memory beyond the limits of a single server via cache-coherent memory expansion cards or memory pools. Especially, In-Memory Database Management Systems (IMDBMSs) can benefit from alleviating two critical constraints: (1) limited memory capacity in a server and (2) long restart time during failover to reload data to memory. However, the usage and effectiveness of CXL memory in enterprise-scale IMDBMSs has yet to be validated. In this work---for the first time---we investigate dynamic memory expansion employing commercial CXL memory devices for IMDBMSs. Our detailed performance analysis reveals that the performance impact of higher latency and lower memory bandwidth impact depends on the memory access patterns of data structures (cf. (1)). Additionally, we present the feasibility of CXL shared memory between servers to improve restart times during failover (cf. (2)). Our evaluation shows the effectiveness of CXL memory integrated into the SAP HANA Cloud IMDBMS. OLTP workloads have a negligible performance degradation while OLAP workloads have a wide range of performance degradation. CXL shared memory shows a 40% reduction of the restart time for TPC-H SF10 and 84% potential reduction for TPC-H SF100.
Minseon Ahn, Thomas Willhalm, Norman May, Donghun Lee 0001, Suprasad Mutalik Desai, Daniel Booss, Navneet Singh, Daniel Ritter 0001, Oliver Rebholz
Proc. VLDB Endow.6
2023 Elastic Use of Far Memory for In-Memory Database Management Systems
abstract
The separation and independent scalability of compute and memory is one of the crucial aspects for modern in-memory database systems (IMDBMSs) in the cloud. The new, cache-coherent memory interconnect Compute Express Link (CXL) promises elastic memory capacity through memory pooling. In this work, we adapt the well-known IMDBMS, SAP HANA, for memory pools by features of table data placement and operational heap memory allocation on far memory, and study the impact of the limited bandwidth and higher latency of CXL. Our results show negligible performance degradation for TPC-C. For the analytical workloads of TPC-H, a notable impact on query processing is observed due to the limited bandwidth and long latency of our early CXL implementation. However, our emulation shows it would be acceptably smaller with the improved CXL memory devices.
Donghun Lee 0001, Thomas Willhalm, Minseon Ahn, Suprasad Mutalik Desai, Daniel Booss, Navneet Singh, Daniel Ritter 0001, Oliver Rebholz
DaMoN5
2017 SAP HANA Adoption of Non-Volatile Memory
abstract
Non-Volatile RAM (NVRAM) is a novel class of hardware technology which is an interesting blend of two storage paradigms: byte-addressable DRAM and block-addressable storage (e.g. HDD/SSD). Most of the existing enterprise relational data management systems such as SAP HANA have their internal architecture based on the inherent assumption that memory is volatile and base their persistence on explicit handling of block-oriented storage devices. In this paper, we present the early adoption of Non-Volatile Memory within the SAP HANA Database, from the architectural and technical angles. We discuss our architectural choices, dive deeper into a few challenges of the NVRAM integration and their solutions, and share our experimental results. As we present our solutions for the NVRAM integration, we also give, as a basis, a detailed description of the relevant HANA internals.
Mihnea Andrei, Christian Lemke, Günter Radestock, Robert Schulze, Carsten Thiel, Rolando Blanco, Akanksha Meghlan, Muhammad Sharique, Sebastian Seifert, Surendra Vishnoi, Daniel Booss, Thomas Peh, Ivan Schreter, Werner Thesing, Mehul Wagle, Thomas Willhalm
Proc. VLDB Endow.11
2017 Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems
abstract
Storage Class Memory (SCM) is a novel class of memory technologies that promise to revolutionize database architectures. SCM is byte-addressable and exhibits latencies similar to those of DRAM, while being non-volatile. Hence, SCM could replace both main memory and storage, enabling a novel single-level database architecture without the traditional I/O bottleneck. Fail-safe persistent SCM allocation can be considered conditio sine qua non for enabling this novel architecture paradigm for database management systems. In this paper we present PAllocator, a fail-safe persistent SCM allocator whose design emphasizes high concurrency and capacity scalability. Contrary to previous works, PAllocator thoroughly addresses the important challenge of persistent memory fragmentation by implementing an efficient defragmentation algorithm. We show that PAllocator outperforms state-of-the-art persistent allocators by up to one order of magnitude, both in operation throughput and recovery time, and enables up to 2.39x higher operation throughput on a persistent B-Tree.
Ismail Oukid, Daniel Booss, Adrien Lespinasse, Wolfgang Lehner, Thomas Willhalm, Grégoire Gomes
Proc. VLDB Endow.2
2016 On testing persistent-memory-based software
abstract
Leveraging Storage Class Memory (SCM) as a universal memory--i.e. as memory and storage at the same time--has deep implications on database architectures. It becomes possible to store a single copy of the data in SCM and directly operate on it at a fine granularity. However, exposing the whole database with direct access to the application dramatically increases the risk of data corruption. In this paper we propose a lightweight on-line testing framework that helps find and debug SCM-related errors that can occur upon software or power failures. Our testing framework simulates failures in critical code paths and achieves fast code coverage by leveraging call stack information to limit duplicate testing. It also partially covers the errors that might arise as a result of reordered memory operations. We show through an experimental evaluation that our testing framework is fast enough to be used with large software systems and discuss its use during the development of our in-house persistent SCM allocator.
Ismail Oukid, Daniel Booss, Adrien Lespinasse, Wolfgang Lehner
DaMoN2
2016 Page As You Go: Piecewise Columnar Access In SAP HANA
abstract
In-memory columnar databases such as SAP HANA achieve extreme performance by means of vector processing over logical units of main memory resident columns. The core in-memory algorithms can be challenged when the working set of an application does not fit into main memory. To deal with memory pressure, most in-memory columnar databases evict candidate columns (or tables) using a set of heuristics gleaned from recent workload. As an alternative approach, we propose to reduce the unit of load and eviction from column to a contiguous portion of the in-memory columnar representation, which we call a page. In this paper, we adapt the core algorithms to be able to operate with partially loaded columns while preserving the performance benefits of vector processing. Our approach has two key advantages. First, partial column loading reduces the mandatory memory footprint for each column, making more memory available for other purposes. Second, partial eviction extends the in-memory lifetime of partially loaded column. We present a new in-memory columnar implementation for our approach, that we term page loadable column. We design a new persistency layout and access algorithms for the encoded data vector of the column, the order-preserving dictionary, and the inverted index. We compare the performance attributes of page loadable columns with those of regular in-memory columns and present a use-case for page loadable columns for cold data in data aging scenarios. Page loadable columns are completely integrated in SAP HANA, and we present extensive experimental results that quantify the performance overhead and the resource consumption when these columns are deployed.
Reza Sherkat, Colin Florendo, Mihnea Andrei, Anil K. Goel, Anisoara Nica, Peter Bumbulis, Ivan Schreter, Günter Radestock, Christian Bensberg, Daniel Booss, Heiko Gerwens
SIGMOD Conference10
2014 SOFORT: a hybrid SCM-DRAM storage engine for fast data recovery
abstract
Storage Class Memory (SCM) has the potential to significantly improve database performance. This potential has been well documented for throughput [4] and response time [25, 22]. In this paper we show that SCM has also the potential to significantly improve restart performance, a shortcoming of traditional main memory database systems. We present SOFORT, a hybrid SCM-DRAM storage engine that leverages full capabilities of SCM by doing away with a traditional log and updating the persisted data in place in small increments. We show that we can achieve restart times of a few seconds independent of instance size and transaction volume without significantly impacting transaction throughput.
Ismail Oukid, Daniel Booss, Wolfgang Lehner, Peter Bumbulis, Thomas Willhalm
DaMoN2