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 Kallman

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

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

Databases, data management, data science and information retrieval · 1 · 1 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
1 paper
Database system architecture and tuning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › main-memory database
in-memory OLTP
0.112008
H-store: a high-performance, distributed main memory transaction processing system · Proc. VLDB Endow. 2008
Distributed systems
distributed database
0.012008
H-store: a high-performance, distributed main memory transaction processing system · Proc. VLDB Endow. 2008

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

stored procedures · 0.2multi-core execution · 0.2
YearPublicationVenuePosition
2008 H-store: a high-performance, distributed main memory transaction processing system
abstract
Our previous work has shown that architectural and application shifts have resulted in modern OLTP databases increasingly falling short of optimal performance [10]. In particular, the availability of multiple-cores, the abundance of main memory, the lack of user stalls, and the dominant use of stored procedures are factors that portend a clean-slate redesign of RDBMSs. This previous work showed that such a redesign has the potential to outperform legacy OLTP databases by a significant factor. These results, however, were obtained using a bare-bones prototype that was developed just to demonstrate the potential of such a system. We have since set out to design a more complete execution platform, and to implement some of the ideas presented in the original paper. Our demonstration presented here provides insight on the development of a distributed main memory OLTP database and allows for the further study of the challenges inherent in this operating environment.
Robert Kallman, Hideaki Kimura 0001, Jonathan Natkins, Andrew Pavlo, Alexander Rasin, Stanley B. Zdonik, Evan P. C. Jones, Samuel Madden 0001, Michael Stonebraker, John Hugg, Daniel J. Abadi
Proc. VLDB Endow.1