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

Robert Seilbeck

dblp:137/6810 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Databases, data management, data science and information retrieval · 3

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
2 papers
Database system architecture and tuning · 68% Indexing and storage engines · 32%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 61% Cloud and datacenter computing · 21% High-performance computing · 18%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Indexing and storage engines › index construction
bulk loading
0.212013
Instant Loading for Main Memory Databases · Proc. VLDB Endow. 2013
Database system architecture and tuning
main-memory database
0.212013
Instant Loading for Main Memory Databases · Proc. VLDB Endow. 2013
Storage systems › data management
data ingestion
0.212013
Instant Loading for Main Memory Databases · Proc. VLDB Endow. 2013
Cloud and datacenter computing › datacenter architecture
wimpy nodes
0.112014
One DBMS for all: the brawny few and the wimpy crowd · SIGMOD Conference 2014
High-performance computing › HPC storage systems
data staging
0.012013
Instant Loading for Main Memory Databases · Proc. VLDB Endow. 2013

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

multi-core CPU optimization · 0.3
YearPublicationVenuePosition
2014 Heterogeneity-conscious parallel query execution: getting a better mileage while driving faster!
abstract
Physical and thermal restrictions hinder commensurate performance gains from the ever increasing transistor density. While multi-core scaling helped alleviate dimmed or dark silicon for some time, future processors will need to become more heterogeneous. To this end, single instruction set architecture (ISA) heterogeneous processors are a particularly interesting solution that combines multiple cores with the same ISA but asymmetric performance and power characteristics. These processors, however, are no free lunch for database systems. Mapping jobs to the core that fits best is notoriously hard for the operating system or a compiler. To achieve optimal performance and energy efficiency, heterogeneity needs to be exposed to the database system.
Tobias Mühlbauer, Wolf Rödiger, Robert Seilbeck, Alfons Kemper, Thomas Neumann 0001
DaMoN3
2014 One DBMS for all: the brawny few and the wimpy crowd
abstract
Shipments of smartphones and tablets with wimpy CPUs are outpacing brawny PC and server shipments by an ever-increasing margin. While high performance database systems have traditionally been optimized for brawny systems, wimpy systems have received only little attention; leading to poor performance and energy inefficiency on such systems.
Tobias Mühlbauer, Wolf Rödiger, Robert Seilbeck, Angelika Reiser, Alfons Kemper, Thomas Neumann 0001
SIGMOD Conference3
2013 Instant Loading for Main Memory Databases
abstract
eScience and big data analytics applications are facing the challenge of efficiently evaluating complex queries over vast amounts of structured text data archived in network storage solutions. To analyze such data in traditional disk-based database systems, it needs to be bulk loaded, an operation whose performance largely depends on the wire speed of the data source and the speed of the data sink, i.e., the disk. As the speed of network adapters and disks has stagnated in the past, loading has become a major bottleneck. The delays it is causing are now ubiquitous as text formats are a preferred storage format for reasons of portability. But the game has changed: Ever increasing main memory capacities have fostered the development of in-memory database systems and very fast network infrastructures are on the verge of becoming economical. While hardware limitations for fast loading have disappeared, current approaches for main memory databases fail to saturate the now available wire speeds of tens of Gbit/s. With Instant Loading, we contribute a novel CSV loading approach that allows scalable bulk loading at wire speed. This is achieved by optimizing all phases of loading for modern super-scalar multi-core CPUs. Large main memory capacities and Instant Loading thereby facilitate a very efficient data staging processing model consisting of instantaneous load-work-unload cycles across data archives on a single node. Once data is loaded, updates and queries are efficiently processed with the flexibility, security, and high performance of relational main memory databases.
Tobias Mühlbauer, Wolf Rödiger, Robert Seilbeck, Angelika Reiser, Alfons Kemper, Thomas Neumann 0001
Proc. VLDB Endow.3