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

Andrej Spielmann

dblp:116/4868 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

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

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
1 paper
Storage systems · 77% Memory systems · 23%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
algorithm synthesis
0.212013
Automatic synthesis of out-of-core algorithms · SIGMOD Conference 2013
Storage systems
out-of-core computation
0.212013
Automatic synthesis of out-of-core algorithms · SIGMOD Conference 2013
Memory systems
memory hierarchy
0.012013
Automatic synthesis of out-of-core algorithms · SIGMOD Conference 2013
YearPublicationVenuePosition
2013 Automatic synthesis of out-of-core algorithms
abstract
We present a system for the automatic synthesis of efficient algorithms specialized for a particular memory hierarchy and a set of storage devices. The developer provides two independent inputs: 1) an algorithm that ignores memory hierarchy and external storage aspects; and 2) a description of the target memory hierarchy, including its topology and parameters. Our system is able to automatically synthesize memory-hierarchy and storage-device-aware algorithms out of those specifications, for tasks such as joins and sorting. The framework is extensible and allows developers to quickly synthesize custom out-of-core algorithms as new storage technologies become available.
Yannis Klonatos, Andres Nötzli, Andrej Spielmann, Christoph Koch 0001, Viktor Kuncak
SIGMOD Conference3