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

Florian Funke 0001

dblp:69/9320 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2016
0000-0001-7301-1550ORCID · corroborated

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

Databases, data management, data science and information retrieval · 4 · 2 first-author

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.

Databases, data mining, and information retrieval
4 papers
Database system architecture and tuning · 47% Query processing and optimization · 46% Transaction processing and concurrency control · 4%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
hybrid transactional and analytical processing
0.532016
Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation · SIGMOD Conference 2016
Compacting Transactional Data in Hybrid OLTP & OLAP Databases · Proc. VLDB Endow. 2012
HyPer-sonic Combined Transaction AND Query Processing · Proc. VLDB Endow. 2011
Database system architecture and tuning
main-memory database
0.322013
CPU and cache efficient management of memory-resident databases · ICDE 2013
Compacting Transactional Data in Hybrid OLTP & OLAP Databases · Proc. VLDB Endow. 2012
Query processing and optimization
query execution
0.212016
Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation · SIGMOD Conference 2016
Query processing and optimization › query compilation
just-in-time compilation
0.212013
CPU and cache efficient management of memory-resident databases · ICDE 2013
Query processing and optimization
query compilation
0.212013
CPU and cache efficient management of memory-resident databases · ICDE 2013
Storage systems
data compression
0.112012
Compacting Transactional Data in Hybrid OLTP & OLAP Databases · Proc. VLDB Endow. 2012
Query processing and optimization
cost model
0.012013
CPU and cache efficient management of memory-resident databases · ICDE 2013
Indexing and storage engines › storage management
storage layout optimization
0.012013
CPU and cache efficient management of memory-resident databases · ICDE 2013

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

data compression · 0.3asynchronous reorganization · 0.3vectorization · 0.2positional SMA · 0.2JIT compilation · 0.2just-in-time compilation · 0.2cost modeling · 0.2
YearPublicationVenuePosition
2016 Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation
abstract
This work aims at reducing the main-memory footprint in high performance hybrid OLTP & OLAP databases, while retaining high query performance and transactional throughput. For this purpose, an innovative compressed columnar storage format for cold data, called Data Blocks is introduced. Data Blocks further incorporate a new light-weight index structure called Positional SMA that narrows scan ranges within Data Blocks even if the entire block cannot be ruled out. To achieve highest OLTP performance, the compression schemes of Data Blocks are very light-weight, such that OLTP transactions can still quickly access individual tuples. This sets our storage scheme apart from those used in specialized analytical databases where data must usually be bit-unpacked. Up to now, high-performance analytical systems use either vectorized query execution or just-in-time (JIT) query compilation. The fine-grained adaptivity of Data Blocks necessitates the integration of the best features of each approach by an interpreted vectorized scan subsystem feeding into JIT-compiled query pipelines. Experimental evaluation of HyPer, our full-fledged hybrid OLTP & OLAP database system, shows that Data Blocks accelerate performance on a variety of query workloads while retaining high transaction throughput.
Harald Lang, Tobias Mühlbauer, Florian Funke 0001, Peter Boncz, Thomas Neumann 0001, Alfons Kemper
SIGMOD Conference3
2013 CPU and cache efficient management of memory-resident databases
abstract
Memory-Resident Database Management Systems (MRDBMS) have to be optimized for two resources: CPU cycles and memory bandwidth. To optimize for bandwidth in mixed OLTP/OLAP scenarios, the hybrid or Partially Decomposed Storage Model (PDSM) has been proposed. However, in current implementations, bandwidth savings achieved by partial decomposition come at increased CPU costs. To achieve the aspired bandwidth savings without sacrificing CPU efficiency, we combine partially decomposed storage with Just-in-Time (JiT) compilation of queries, thus eliminating CPU inefficient function calls. Since existing cost based optimization components are not designed for JiT-compiled query execution, we also develop a novel approach to cost modeling and subsequent storage layout optimization. Our evaluation shows that the JiT-based processor maintains the bandwidth savings of previously presented hybrid query processors but outperforms them by two orders of magnitude due to increased CPU efficiency.
Holger Pirk, Florian Funke 0001, Martin Grund, Thomas Neumann 0001, Ulf Leser, Stefan Manegold, Alfons Kemper, Martin L. Kersten
ICDE2
2012 Compacting Transactional Data in Hybrid OLTP & OLAP Databases
abstract
Growing main memory sizes have facilitated database management systems that keep the entire database in main memory. The drastic performance improvements that came along with these in-memory systems have made it possible to reunite the two areas of online transaction processing (OLTP) and online analytical processing (OLAP): An emerging class of hybrid OLTP and OLAP database systems allows to process analytical queries directly on the transactional data. By offering arbitrarily current snapshots of the transactional data for OLAP, these systems enable real-time business intelligence. Despite memory sizes of several Terabytes in a single commodity server, RAM is still a precious resource: Since free memory can be used for intermediate results in query processing, the amount of memory determines query performance to a large extent. Consequently, we propose the compaction of memory-resident databases. Compaction consists of two tasks: First, separating the mutable working set from the immutable "frozen" data. Second, compressing the immutable data and optimizing it for efficient, memory-consumption-friendly snapshotting. Our approach reorganizes and compresses transactional data online and yet hardly affects the mission-critical OLTP throughput. This is achieved by unburdening the OLTP threads from all additional processing and performing these tasks asynchronously.
Florian Funke 0001, Alfons Kemper, Thomas Neumann 0001
Proc. VLDB Endow.1
2011 HyPer-sonic Combined Transaction AND Query Processing
Florian Funke 0001, Alfons Kemper, Thomas Neumann 0001
Proc. VLDB Endow.1