research-article

Hekaton: SQL server's memory-optimized OLTP engine

Authors:

Cristian Diaconu,

Craig Freedman,

Per-Ake Larson,

Ryan Stonecipher,

Nitin Verma, and

Mike ZwillingAuthors Info & Claims

SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

June 2013

Pages 1243 - 1254

https://doi.org/10.1145/2463676.2463710

Published: 22 June 2013 Publication History

Abstract

Hekaton is a new database engine optimized for memory resident data and OLTP workloads. Hekaton is fully integrated into SQL Server; it is not a separate system. To take advantage of Hekaton, a user simply declares a table memory optimized. Hekaton tables are fully transactional and durable and accessed using T-SQL in the same way as regular SQL Server tables. A query can reference both Hekaton tables and regular tables and a transaction can update data in both types of tables. T-SQL stored procedures that reference only Hekaton tables can be compiled into machine code for further performance improvements. The engine is designed for high con-currency. To achieve this it uses only latch-free data structures and a new optimistic, multiversion concurrency control technique. This paper gives an overview of the design of the Hekaton engine and reports some experimental results.

References

[1]

Florian Funke, Alfons Kemper, Thomas Neumann: HyPer-sonic Combined Transaction AND Query Processing. PVLDB 4(12): 1367--1370 (2011)

[2]

Martin Grund, Jens Krüger, Hasso Plattner, Alexander Zeier, Philippe Cudré-Mauroux, Samuel Madden: HYRISE - A Main Memory Hybrid Storage Engine. PVLDB 4(2): 105--116 (2010)

Digital Library

[3]

Martin Grund, Philippe Cudré-Mauroux, Jens Krüger, Samuel Madden, Hasso Plattner: An overview of HYRISE - a Main Memory Hybrid Storage Engine. IEEE Data Eng. Bull. 35(1): 52--57 (2012)

[4]

Stavros Harizopoulos, Daniel J. Abadi, Samuel Madden, Mi-chael Stonebraker: OLTP through the looking glass, and what we found there. SIGMOD 2008: 981--992

Digital Library

[5]

IBM SolidDB, http://www.ibm.com/software/data/soliddb

[6]

Ryan Johnson, Ippokratis Pandis, Nikos Hardavellas, Anasta-sia Ailamaki, Babak Falsafi: Shore-MT: a scalable storage manager for the multicore era. EDBT 2009: 24--35

Digital Library

[7]

Robert Kallman, Hideaki Kimura, Jonathan Natkins, Andrew Pavlo, Alex Rasin, Stanley B. Zdonik, Evan P. C. Jones, Samuel Madden, Michael Stonebraker, Yang Zhang, John Hugg, Daniel J. Abadi: H-store: a high-performance, distrib-uted main memory transaction processing system. PVLDB 1(2): 1496--1499 (2008)

Digital Library

[8]

Alfons Kemper, Thomas Neumann: HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots. ICDE 2011: 195--206

Digital Library

[9]

Per-Åke Larson, Spyros Blanas, Cristian Diaconu, Craig Freedman, Jignesh M. Patel, Mike Zwilling: High-Performance Concurrency Control Mechanisms for Main-Memory Databases. PVLDB 5(4): 298--309 (2011)

Digital Library

[10]

Justin J. Levandoski, David B. Lomet, Sudipta Sengupta, The Bw-Tree: A B-tree for New Hardware Platforms, ICDE 2013 (to appear).

[11]

The LLVM Compiler Infrastructure, http://llvm.org/

[12]

Maged M. Michael. 2004. Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE Trans. Parallel Dis-trib. Syst. 15, 6 (June 2004), 491--504.

Digital Library

[13]

Maged M. Michael. 2002. High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the four-teenth annual ACM symposium on Parallel algorithms and ar-chitectures (SPAA '02): 73--82.

Digital Library

[14]

Thomas Neumann: Efficiently Compiling Efficient Query Plans for Modern Hardware. PVLDB 4(9): 539--550 (2011)

Digital Library

[15]

Oracle TimesTen, http://www.oracle.com/technetwork/products/timesten/overview/index.html

[16]

Ippokratis Pandis, Ryan Johnson, Nikos Hardavellas, Anasta-sia Ailamaki: Data-Oriented Transaction Execution. PVLDB 3(1): 928--939 (2010)

Digital Library

[17]

Phoenix compiler framework, http://en.wikipedia.org/wiki/Phoenix_(compiler_framework)

[18]

SAP In-Memory Computing, http://www.sap.com/solutions/technology/in-memory-computing-platform/hana/overview/index.epx

[19]

Sybase In-Memory Databases, http://www.sybase.com/manage/in-memory-databases

[20]

Håkan Sundell, Philippas Tsiga, Lock-free deques and doubly linked lists, Journal of Parallel and Distributed Computing - JPDC, 68(7): 1008--1020, (2008)

Digital Library

[21]

VoltDB, http://voltdb.com

Cited By

Chen GHe ZLi MLuo S(2024)Oasis: An Optimal Disjoint Segmented Learned Range FilterProceedings of the VLDB Endowment10.14778/3659437.365944717:8(1911-1924)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659447
Gao CBallijepalli SWang J(2024)Revisiting B-tree Compression: An Experimental StudyProceedings of the ACM on Management of Data10.1145/36549722:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654972
Drescher FEngelke ARodríguez GSadayappan PSukumaran-Rajam A(2024)Fast Template-Based Code Generation for MLIRProceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction10.1145/3640537.3641567(1-12)Online publication date: 17-Feb-2024
https://dl.acm.org/doi/10.1145/3640537.3641567
Show More Cited By

Index Terms

Hekaton: SQL server's memory-optimized OLTP engine

Recommendations

FoundationDB: A Distributed Unbundled Transactional Key Value Store
SIGMOD '21: Proceedings of the 2021 International Conference on Management of Data

FoundationDB is an open source transactional key value store created more than ten years ago. It is one of the first systems to combine the flexibility and scalability of NoSQL architectures with the power of ACID transactions (a.k.a. NewSQL). ...
Read More
ERMIA: Fast Memory-Optimized Database System for Heterogeneous Workloads
SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data

Large main memories and massively parallel processors have triggered not only a resurgence of high-performance transaction processing systems optimized for large main-memory and massively parallel processors, but also an increasing demand for processing ...
Read More
Building data mining solutions with OLE DB for DM and XML for analysis

A data mining component is included in Microsoft SQL Server 2000 and SQL Server 2005, one of the most popular DBMSs. This gives a push for data mining technologies to move from a niche towards the mainstream. Apart from a few algorithms, the main ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

June 2013

1322 pages

ISBN:9781450320375

DOI:10.1145/2463676

General Chairs:
Kenneth Ross
Columbia University
,
Divesh Srivastava
AT&T Research
,
Program Chair:
Dimitris Papadias
HKUST

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS'13

Sponsor:

SIGMOD

SIGMOD/PODS'13: International Conference on Management of Data

June 22 - 27, 2013

New York, New York, USA

Acceptance Rates

SIGMOD '13 Paper Acceptance Rate 76 of 372 submissions, 20%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

401
Total Citations
View Citations
2,082
Total Downloads

Downloads (Last 12 months)106
Downloads (Last 6 weeks)8

Other Metrics

View Author Metrics

Citations

Cited By

Chen GHe ZLi MLuo S(2024)Oasis: An Optimal Disjoint Segmented Learned Range FilterProceedings of the VLDB Endowment10.14778/3659437.365944717:8(1911-1924)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.14778/3659437.3659447
Gao CBallijepalli SWang J(2024)Revisiting B-tree Compression: An Experimental StudyProceedings of the ACM on Management of Data10.1145/36549722:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654972
Drescher FEngelke ARodríguez GSadayappan PSukumaran-Rajam A(2024)Fast Template-Based Code Generation for MLIRProceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction10.1145/3640537.3641567(1-12)Online publication date: 17-Feb-2024
https://dl.acm.org/doi/10.1145/3640537.3641567
Camacho-Rodríguez JAgrawal AGruenheid AGosalia APetculescu CAguilar-Saborit JFloratou ACurino CRamakrishnan R(2024)LST-Bench: Benchmarking Log-Structured Tables in the CloudProceedings of the ACM on Management of Data10.1145/36393142:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639314
Blelloch GWei YLee IChabbi MSteuwer M(2024)VERLIB: Concurrent Versioned PointersProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638501(200-214)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638501
Pandey PFarach-Colton MDayan NZhang HBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Beyond Bloom: A Tutorial on Future Feature-Rich FiltersCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654681(636-644)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654681
Engelke ASchwarz T(2024)Compile-Time Analysis of Compiler Frameworks for Query Compilation2024 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO57630.2024.10444856(233-244)Online publication date: 2-Mar-2024
https://doi.org/10.1109/CGO57630.2024.10444856
Zhang QSong HZhou KWei JXiao C(2024)A prefetching indexing scheme for in-memory database systemsFuture Generation Computer Systems10.1016/j.future.2024.03.012156(179-190)Online publication date: Jul-2024
https://doi.org/10.1016/j.future.2024.03.012
Wang RGao CWang JKadam PTamerÖzsu MAref W(2024)Optimizing LSM-based indexes for disaggregated memoryThe VLDB Journal10.1007/s00778-024-00863-yOnline publication date: 19-Jun-2024
https://doi.org/10.1007/s00778-024-00863-y
Magalhaes ABrayner AMonteiro J(2024)MM-DIRECTThe VLDB Journal10.1007/s00778-024-00846-z33:3(859-882)Online publication date: 27-Mar-2024
https://doi.org/10.1007/s00778-024-00846-z
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents