Lazy Evaluation for Concurrent OLTP and Bulk Transactions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
LanguageEnglish
Title of host publicationProceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016)
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages115-124
Number of pages10
ISBN (Print)978-1-4503-4118-9
DOIs
StatePublished - 11 Jul 2016

Publication series

Name
PublisherACM

Fingerprint

Concurrency control
Data structures
Throughput
Control systems

Keywords

  • Transactions
  • EWI-27045
  • Lazy Evaluation
  • Contention
  • IR-100640
  • METIS-317211
  • Bulk Update

Cite this

Wevers, L., Huisman, M., & van Keulen, M. (2016). Lazy Evaluation for Concurrent OLTP and Bulk Transactions. In Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016) (pp. 115-124). New York: Association for Computing Machinery. DOI: 10.1145/2938503.2938555
Wevers, L. ; Huisman, Marieke ; van Keulen, Maurice. / Lazy Evaluation for Concurrent OLTP and Bulk Transactions. Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016). New York : Association for Computing Machinery, 2016. pp. 115-124
@inproceedings{12a35936159e4e0f9832b1b62ce7e163,
title = "Lazy Evaluation for Concurrent OLTP and Bulk Transactions",
abstract = "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.",
keywords = "Transactions, EWI-27045, Lazy Evaluation, Contention, IR-100640, METIS-317211, Bulk Update",
author = "L. Wevers and Marieke Huisman and {van Keulen}, Maurice",
note = "eemcs-eprint-27045",
year = "2016",
month = "7",
day = "11",
doi = "10.1145/2938503.2938555",
language = "English",
isbn = "978-1-4503-4118-9",
publisher = "Association for Computing Machinery",
pages = "115--124",
booktitle = "Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016)",
address = "United States",

}

Wevers, L, Huisman, M & van Keulen, M 2016, Lazy Evaluation for Concurrent OLTP and Bulk Transactions. in Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016). Association for Computing Machinery, New York, pp. 115-124. DOI: 10.1145/2938503.2938555

Lazy Evaluation for Concurrent OLTP and Bulk Transactions. / Wevers, L.; Huisman, Marieke; van Keulen, Maurice.

Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016). New York : Association for Computing Machinery, 2016. p. 115-124.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Lazy Evaluation for Concurrent OLTP and Bulk Transactions

AU - Wevers,L.

AU - Huisman,Marieke

AU - van Keulen,Maurice

N1 - eemcs-eprint-27045

PY - 2016/7/11

Y1 - 2016/7/11

N2 - 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.

AB - 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.

KW - Transactions

KW - EWI-27045

KW - Lazy Evaluation

KW - Contention

KW - IR-100640

KW - METIS-317211

KW - Bulk Update

U2 - 10.1145/2938503.2938555

DO - 10.1145/2938503.2938555

M3 - Conference contribution

SN - 978-1-4503-4118-9

SP - 115

EP - 124

BT - Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016)

PB - Association for Computing Machinery

CY - New York

ER -

Wevers L, Huisman M, van Keulen M. Lazy Evaluation for Concurrent OLTP and Bulk Transactions. In Proceedings of the 20th International Database Engineering & Applications Symposium (IDEAS 2016). New York: Association for Computing Machinery. 2016. p. 115-124. Available from, DOI: 10.1145/2938503.2938555