Lazy Evaluation for Concurrent OLTP and Bulk Transactions

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

207 Downloads (Pure)


Existing concurrency control systems cannot execute transactions with overlapping updates 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 micro benchmarks.
Original languageEnglish
Title of host publicationProceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016)
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Print)978-1-4503-4118-9
Publication statusPublished - 11 Jul 2016
Event20th International Database Engineering & Applications Symposium, IDEAS 2016 - Montreal, Canada
Duration: 11 Jul 201613 Jul 2016


Conference20th International Database Engineering & Applications Symposium, IDEAS 2016
Other11-13 July 2016


  • Transactions
  • Lazy evaluation
  • Contention
  • Bulk update


Dive into the research topics of 'Lazy Evaluation for Concurrent OLTP and Bulk Transactions'. Together they form a unique fingerprint.

Cite this