Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Cristian Diaconu is active.

Publication


Featured researches published by Cristian Diaconu.


international conference on management of data | 2013

Hekaton: SQL server's memory-optimized OLTP engine

Cristian Diaconu; Craig Steven Freedman; Erik Ismert; Per-Ake Larson; Pravin Mittal; Ryan L. Stonecipher; Nitin Verma; Mike Zwilling

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.


very large data bases | 2011

High-performance concurrency control mechanisms for main-memory databases

Per-Ake Larson; Spyros Blanas; Cristian Diaconu; Craig Steven Freedman; Jignesh M. Patel; Mike Zwilling

A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory databases. Both use multiversioning to isolate read-only transactions from updates but differ in how atomicity is ensured: one is optimistic and one is pessimistic. To avoid expensive context switching, transactions never block during normal processing but they may have to wait before commit to ensure correct serialization ordering. We also implemented a main-memory optimized version of single-version locking. Experimental results show that while single-version locking works well when transactions are short and contention is low performance degrades under more demanding conditions. The multiversion schemes have higher overhead but are much less sensitive to hotspots and the presence of long-running transactions.


Archive | 2010

Distributed transaction management for database systems with multiversioning

Per-Ake Larson; Michael James Zwilling; Cristian Diaconu


Archive | 2009

OPTIMISTIC SERIALIZABLE SNAPSHOT ISOLATION

Per-Ake Larson; Cristian Diaconu; Michael James Zwilling; Craig Steven Freedman


Archive | 2009

CACHE-FRIENDLY B-TREE ACCELERATOR

Craig Steven Freedman; Cristian Diaconu; Michael James Zwilling


Archive | 2010

VERSATILE IN-MEMORY DATABASE RECOVERY

Mike Zwilling; Per-Ake Larson; Cristian Diaconu


Archive | 2011

EFFICIENT MULTI-VERSION LOCKING FOR MAIN MEMORY DATABASES

Per-Ake Larson; Spyridon Blanas; Cristian Diaconu


Archive | 2006

User mode file system serialization and reliability

Arkadi Brjazovski; Rohan Kumar; Cristian Diaconu; Oleksandr Gololobov; Mahesh K. Sreenivas


international conference on management of data | 2014

Indexing on modern hardware: hekaton and beyond

Justin J. Levandoski; David B. Lomet; Sudipta Sengupta; Adrian Birka; Cristian Diaconu


Archive | 2015

Efficient maintenance of column store indexes on memory-optimized tables

Devin Leo Rider; Vasileios Papadimos; Xin Zhang; Adrian Birka; Per-Ake Larson; Cristian Diaconu

Collaboration


Dive into the Cristian Diaconu's collaboration.

Researchain Logo
Decentralizing Knowledge