H-store: a high-performance, distributed main memory transaction processing system

  title={H-store: a high-performance, distributed main memory transaction processing system},
  author={Robert Kallman and Hideaki Kimura and Jonathan Natkins and Andrew Pavlo and Alexander Rasin and Stanley B. Zdonik and Evan P. C. Jones and Samuel Madden and Michael Stonebraker and Yang Zhang and John Hugg and Daniel J. Abadi},
  journal={Proc. VLDB Endow.},
Our previous work has shown that architectural and application shifts have resulted in modern OLTP databases increasingly falling short of optimal performance [10. [] Key Result 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.

Figures from this paper

Transactional Partitioning: A New Abstraction for Main-Memory Databases
This work proposes an intuitive, high-level programming model which allows OLTP applications to be modeled as a cluster of application logic units and extends transactions guaranteeing full ACID semantics to provide the proposed model, to maintain ease of application development.
In-memory transaction processing: efficiency and scalability considerations
A wide spectrum of design and implementation considerations that may affect the efficiency or scalability of an in-memory OLTP system are surveyed, including concurrency control, logging, indexing and transaction compilation.
A Prolegomenon on OLTP Database Systems for Non-Volatile Memory
The evaluation shows that in both storage hierarchies, memory-oriented systems are able to outperform their disk-oriented counterparts, but as skew decreases the performance of the two architectures converge, showing that neither architecture is ideally suited for an NVM-based storage hierarchy.
Robust concurrency control in main-memory DBMS: What main memory giveth, the application taketh away
It is argued that the shift to heterogenous workloads means effective and robust CC schemes will become increasingly important for main-memory DBMS going forward.
Transactions Chasing Scalability and Instruction Locality on Multicores
An alternative shared-everything system based on physiological partitioning (PLP) is designed to eliminate the unbounded critical sections of traditional OLTP systems while providing an infrastructure for low-cost dynamic repartitioning and without introducing high-cost distributed transactions.
Dynamic and Transparent Data Tiering for In-Memory Databases in Mixed Workload Environments
This paper presents a new approach for in-memory databases that exploits data relevance and places less relevant data onto a NAND flash device and is able to efficiently evict a substantial share of the data stored in memory while suffering a performance loss of less than 30%.
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
A novel approach to automatically partitioning databases for enterprise-class OLTP systems that significantly extends the state of the art by minimizing the number distributed transactions, while concurrently mitigating the effects of temporal skew in both the data distribution and accesses is presented.
Efficient Processing of Range Queries in Main Memory
A cache-optimized, updateable main-memory index structure, the cache-sensitive skip list, is proposed, which targets the execution of range queries on single database columns, and a novel, fast and space-efficient, main- memory based index structure is devised, the BB-Tree, which supports multidimensional range and point queries and provides a parallel search operator that leverages the multi-threading capabilities of modern CPUs.
In-Memory Big Data Management and Processing: A Survey
This survey aims to provide a thorough review of a wide range of in-memory data management and processing proposals and systems, including both data storage systems and data processing frameworks.
ScyPer: elastic OLAP throughput on transactional data
ScyPer is presented, a Scale-out of the authors' HyPer main memory database system that horizontally scales out on shared-nothing hardware, aimed at sustaining the superior OLTP throughput of a single HyPer server, and providing elastic OLAP throughput by provisioning additional servers on-demand, e.g., in the Cloud.


DataBlitz: A High Performance Main-Memory Storage Manager
The Dali system is a main memory storage manager designed to provide the persistence, availability and safety guarantees one typically expects from a diskresident database, while at the same time providing very high performance by virtue of being tuned to support in-memory data.
GAMMA - A High Performance Dataflow Database Machine
The Gamma prototype shows how parallelism can be controlled with minimal control overhead through a combination of the use of algorithms based on hashing and the pipelining of data between processes.
The End of an Architectural Era (It's Time for a Complete Rewrite)
The current RDBMS code lines, while attempting to be a "one size fits all" solution, in fact, excel at nothing and should be retired in favor of a collection of "from scratch" specialized engines.
High volume transaction processing without currency control, two phase commit, SQLor C++
This work uses a list-based language called K having optimized support for bulk array operators, and that integrates networking, and a graphical user interface that shows how to exploit multiple processors without complicating the language or the basic framework.
Optimization of parallel query execution plans in XPRS
  • Wei Hong, M. Stonebraker
  • Computer Science
    [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems
  • 1991
The two phase optimization strategy is presented and experimental evidence is given that it almost always produces optimal or close to optimal plans in XPRS, a multiuser parallel database system based on a shared memory multiprocessor and a disk array.
System R: relational approach to database management
This paper contains a description of the overall architecture and design of the system, and emphasizes that System R is a vehicle for research in database architecture, and is not planned as a product.
SIREN: A Memory-Conserving, Snapshot-Consistent Checkpoint Algorithm for in-Memory Databases
This paper presents a consistency-preserving and memory-efficient checkpoint method based on tuple shadowing as opposed to known page shadowing methods, and rearranging of tuples between pages for minimal memory usage overhead.
C-Store: A Column-oriented DBMS
Preliminary performance data on a subset of TPC-H is presented and it is shown that the system the team is building, C-Store, is substantially faster than popular commercial products.
One Size Fits All? Part 2: Benchmarking Studies
The major contribution of the paper is to show “apples to apples” performance numbers between commercial implementations of specialized architectures and relational DBMSs in both stream processing and data warehouses.