User Tools

Site Tools


Lazy Evaluation for Concurrent OLTP and Bulk Transactions

Lesley Wevers (2016-05-24 12:30 - 13:30 in HAL B-2B)

Existing concurrency control systems cannot execute transactions with overlapping up- dates concurrently. This is especially problematic for bulk updates, which usually overlap with all concurrent transactions. To solve this, we have developed a concurrency control mechanism based on lazy evaluation, which moves evaluation of operations from the writer to the reader. This allows readers to prioritize evaluation of those operations in which they are interested, without loss of atomicity of transactions. To handle bulk operations, we dynamically split large transactions into transactions on smaller parts of the data. In this paper we present an abstract lazy index structure for lazy transactions, and show how transactions can be encoded to effectively use this data structure. Moreover, we discuss evaluation strategies for lazy transactions, where trade-offs can be made between latency and throughput. To evaluate our approach, we have implemented a concurrent lazy trie, on which we performed a number of benchmarks.

colloquium/lazy_evaluation_for_concurrent_oltp.txt · Last modified: 2016/05/23 13:09 by Djoerd Hiemstra