Hardware acceleration of compression and encryption in SAP HANA

M Chiosa, F Maschi, I Müller… - Proceedings of the …, 2022 - research-collection.ethz.ch
With the advent of cloud computing, where computational resources are expensive and data
movement needs to be secured and minimized, database management systems need to …

Main memory database systems

F Faerber, A Kemper, PÅ Larson… - … and Trends® in …, 2017 - nowpublishers.com
This article provides an overview of recent developments in mainmemory database systems.
With growing memory sizes and memory prices dropping by a factor of 10 every 5 years …

BtrBlocks: efficient columnar compression for data lakes

M Kuschewski, D Sauerwein, A Alhomssi… - Proceedings of the ACM …, 2023 - dl.acm.org
Analytics is moving to the cloud and data is moving into data lakes. These reside on object
storage services like S3 and enable seamless data sharing and system interoperability. To …

Good to the last bit: Data-driven encoding with codecdb

H Jiang, C Liu, J Paparrizos, AA Chien, J Ma… - Proceedings of the …, 2021 - dl.acm.org
Columnar databases rely on specialized encoding schemes to reduce storage
requirements. These encodings also enable efficient in-situ data processing. Nevertheless …

Requirements and Trade-Offs of Compression Techniques in Key–Value Stores: A Survey

C Jaranilla, J Choi - Electronics, 2023 - mdpi.com
The prevalence of big data has caused a notable surge in both the diversity and magnitude
of data. Consequently, this has prompted the emergence and advancement of two distinct …

FSST: fast random access string compression

P Boncz, T Neumann, V Leis - Proceedings of the VLDB Endowment, 2020 - dl.acm.org
Strings are prevalent in real-world data sets. They often occupy a large fraction of the data
and are slow to process. In this work, we present Fast Static Symbol Table (FSST), a …

Data-parallel query processing on non-uniform data

H Funke, J Teubner - Proceedings of the VLDB Endowment, 2020 - dl.acm.org
Graphics processing units (GPUs) promise spectacular performance advantages when used
as database coprocessors. Their massive compute capacity, however, is often hampered by …

Fast succinct retrieval and approximate membership using ribbon

PC Dillinger, L Hübschle-Schneider, P Sanders… - arXiv preprint arXiv …, 2021 - arxiv.org
A retrieval data structure for a static function $ f: S\rightarrow\{0, 1\}^ r $ supports queries that
return $ f (x) $ for any $ x\in S $. Retrieval data structures can be used to implement a static …

Interleaving with coroutines: a practical approach for robust index joins

G Psaropoulos, T Legler, N May… - Proceedings of the …, 2017 - infoscience.epfl.ch
Index join performance is determined by the efficiency of the lookup operation on the
involved index. Although database indexes are highly optimized to leverage processor …

Celonis PQL: A query language for process mining

T Vogelgesang, J Ambrosy, D Becher… - Process querying …, 2021 - Springer
Process mining studies data-driven methods to discover, enhance, and monitor business
processes by gathering knowledge from event logs recorded by modern IT systems. To gain …