No abstract available.
Proceeding Downloads
Analyzing memory accesses with modern processors
Debugging and tuning database systems is very challenging. Using common profiling tools is often not sufficient because they identify the machine instruction rather than the instance of a data structure that causes a performance problem. This leaves a ...
Scalable and robust latches for database systems
Multi-core scalability is one of the most important features for database systems running on today's hardware. Not surprisingly, the implementation of locks is paramount to achieving efficient and scalable synchronization. In this work, we identify the ...
The tale of 1000 Cores: an evaluation of concurrency control on real(ly) large multi-socket hardware
In this paper, we set out the goal to revisit the results of "Starring into the Abyss [...] of Concurrency Control with [1000] Cores" [27] and analyse in-memory DBMSs on today's large hardware. Despite the original assumption of the authors, today we do ...
Large-scale in-memory analytics on Intel® Optane™ DC persistent memory
New data storage technologies such as the recently introduced Intel® Optane™ DC Persistent Memory Module (PMM) offer exciting opportunities for optimizing the query processing performance of database workloads. In particular, the unique combination of ...
Concurrent online sampling for all, for free
Database systems rely upon statistical synopses for cardinality estimation. A very versatile and powerful method for estimation purposes is to maintain a random sample of the data. However, drawing a random sample of an existing data set is quite ...
Efficient generation of machine code for query compilers
Query compilation can make query execution extremely efficient, but it introduces additional compilation time. The compilation time causes a relatively high overhead especially for short-running and high-complexity queries.
We propose Flounder IR as a ...
The collection Virtual Machine: an abstraction for multi-frontend multi-backend data analysis
Getting the best performance from the ever-increasing number of hardware platforms has been a recurring challenge for data processing systems. In recent years, the advent of data science with its increasingly numerous and complex types of analytics has ...
Accelerating re-pair compression using FPGAs
- Robert Lasch,
- Suleyman S. Demirsoy,
- Norman May,
- Veeraraghavan Ramamurthy,
- Christian Färber,
- Kai-Uwe Sattler
Re-Pair is a compression algorithm well-suited for applications that require random accesses to compressed data, but has not found widespread use in the data management community due to its prohibitively high compression times. As Re-Pair is a ...
FPGA-Accelerated compression of integer vectors
An efficient compression of integer vectors is critical in dictionary-encoded column stores like SAP HANA to keep more data in the limited and precious main memory. Past research focused on lightweight compression techniques that trade low latency of ...
nKV: near-data processing with KV-stores on native computational storage
Massive data transfers in modern key/value stores resulting from low data-locality and data-to-code system design hurt their performance and scalability. Near-data processing (NDP) designs represent a feasible solution, which although not new, have yet ...
Comparative analysis of OpenCL and RTL for sort-merge primitives on FPGA
As a result of recent improvements in FPGA technology, their benefits for highly efficient data processing pipelines are becoming more and more apparent. However, traditional RTL methods for programming FPGAs require knowledge of digital design and ...
To share or not to share vector registers?
Query execution techniques constantly adapt to novel hardware features to achieve high query performance, in particular for analytical queries. In recent years, vectorization based on the Single Instruction Multiple Data (SIMD) parallel paradigm has ...
Let's add transactions to FPGA-based key-value stores!
In recent years we have seen a proliferation of FPGA-based key value stores (KVSs) [1--3, 5--7, 10] driven by the need for more efficient large-scale data management and storage solutions. In this context, FPGAs are useful because they offer network-...
Lessons learned from the early performance evaluation of Intel optane DC persistent memory in DBMS
Non-volatile memory (NVM) is an emerging technology, which has the persistence characteristics of large capacity storage devices, while providing the low access latency and byte-addressablity of traditional DRAM memory. In this paper, we provide ...
Data structure primitives on persistent memory: an evaluation
Persistent Memory (PM) represents a very promising, next-generation memory solution with a significant impact on database architectures. Several data structures for this new technology have already been proposed. However, primarily only complete ...
Empirical evaluation across multiple GPU-accelerated DBMSes
In this paper we conduct an empirical study across modern GPU-accelerated DBMSes with TPC-H workloads. Our rigorous experiments demonstrate that the studied DBMSes appear to utilize GPU resource effectively but do not scale well with growing databases ...
The ReProVide query-sequence optimization in a hardware-accelerated DBMS
Hardware acceleration of database query processing can be done with the help of FPGAs. In particular, they are partially reconfigurable at runtime, which allows for the adaptation to a variety of queries. Reconfiguration itself, however, takes some ...
Variable word length word-aligned hybrid compression
The Word-Aligned Hybrid (WAH) compression is a prominent example of a lightweight compression scheme for bitmap indices that considers the word size of the underlying architecture. This is a compromise toward commodity CPUs, where operations below the ...
Index Terms
- Proceedings of the 16th International Workshop on Data Management on New Hardware