Dodo: A scalable optimistic deterministic concurrency control protocol

Deterministic concurrency control is able to avoid the expensive two-phase commit in distributed databases and can solve the single-thread bottleneck of transaction processing in blockchain systems. Most existing deterministic concurrency control protocols rely on prior knowledge of the transaction’...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Future generation computer systems Ročník 159; s. 15 - 26
Hlavní autoři: Wang, Xinyuan, Peng, Yun, Huang, Hejiao, Li, Xingchen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.10.2024
Témata:
ISSN:0167-739X, 1872-7115
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Deterministic concurrency control is able to avoid the expensive two-phase commit in distributed databases and can solve the single-thread bottleneck of transaction processing in blockchain systems. Most existing deterministic concurrency control protocols rely on prior knowledge of the transaction’s read-write set, which is impractical in most cases. The state-of-the-art deterministic concurrency control protocols Aria and DOCC break this limitation. However, they do not perform well in multi-node and multi-core scalability. To solve the scalability issues, we propose Dodo, a novel deterministic concurrency control protocol. Dodo processes transactions in multi-batches, and each batch is divided into three phases. In the first phase, transactions are executed as read committed and staged. In the second phase, transactions are validated for the read-write conflict. In the third phase, only the continuous un-conflicted transactions at the head of the batch can be committed. For the aborted transaction that will be rerun in the next batch, we utilize its write set in the previous execution to reduce the read-write conflicts in the next batch. In this way, Dodo has the following benefits. First, Dodo does not rely on the prior knowledge of the read-write set. Second, Dodo commits transactions in pre-determined orders (TIDs) providing high multi-node scalability. Third, Dodo runs transactions in each phase concurrently, and the aborted transactions are re-executed in a conflict-less manner, enabling high multi-core scalability. Besides, we propose two optimism-based improvements, lazy decision and early-write visibility, to reduce aborts and blocking. Our evaluation shows that Dodo outperforms Aria and DOCC by up to 16.5x and 8.0x in a single-node setting and scales well in a multi-node setting. •We propose a novel deterministic concurrency control protocol Dodo.•Dodo solves the scalability issue of state-of-the-art protocols (Aria and DOCC).•Dodo outperforms Aria and DOCC by up to 16.5x in multi-core settings.•Dodo has better multi-node scalability than Aria.
AbstractList Deterministic concurrency control is able to avoid the expensive two-phase commit in distributed databases and can solve the single-thread bottleneck of transaction processing in blockchain systems. Most existing deterministic concurrency control protocols rely on prior knowledge of the transaction’s read-write set, which is impractical in most cases. The state-of-the-art deterministic concurrency control protocols Aria and DOCC break this limitation. However, they do not perform well in multi-node and multi-core scalability. To solve the scalability issues, we propose Dodo, a novel deterministic concurrency control protocol. Dodo processes transactions in multi-batches, and each batch is divided into three phases. In the first phase, transactions are executed as read committed and staged. In the second phase, transactions are validated for the read-write conflict. In the third phase, only the continuous un-conflicted transactions at the head of the batch can be committed. For the aborted transaction that will be rerun in the next batch, we utilize its write set in the previous execution to reduce the read-write conflicts in the next batch. In this way, Dodo has the following benefits. First, Dodo does not rely on the prior knowledge of the read-write set. Second, Dodo commits transactions in pre-determined orders (TIDs) providing high multi-node scalability. Third, Dodo runs transactions in each phase concurrently, and the aborted transactions are re-executed in a conflict-less manner, enabling high multi-core scalability. Besides, we propose two optimism-based improvements, lazy decision and early-write visibility, to reduce aborts and blocking. Our evaluation shows that Dodo outperforms Aria and DOCC by up to 16.5x and 8.0x in a single-node setting and scales well in a multi-node setting. •We propose a novel deterministic concurrency control protocol Dodo.•Dodo solves the scalability issue of state-of-the-art protocols (Aria and DOCC).•Dodo outperforms Aria and DOCC by up to 16.5x in multi-core settings.•Dodo has better multi-node scalability than Aria.
Author Huang, Hejiao
Peng, Yun
Li, Xingchen
Wang, Xinyuan
Author_xml – sequence: 1
  givenname: Xinyuan
  orcidid: 0000-0001-6359-7869
  surname: Wang
  fullname: Wang, Xinyuan
  organization: Harbin Institute of Technology (Shenzhen), Shenzhen, 518071, Guangdong, China
– sequence: 2
  givenname: Yun
  orcidid: 0000-0001-6358-2333
  surname: Peng
  fullname: Peng, Yun
  organization: Guangzhou University, Guangzhou, 510006, Guangdong, China
– sequence: 3
  givenname: Hejiao
  orcidid: 0000-0001-8728-3012
  surname: Huang
  fullname: Huang, Hejiao
  email: huanghejiao@hit.edu.cn
  organization: Harbin Institute of Technology (Shenzhen), Shenzhen, 518071, Guangdong, China
– sequence: 4
  givenname: Xingchen
  surname: Li
  fullname: Li, Xingchen
  organization: Harbin Institute of Technology (Shenzhen), Shenzhen, 518071, Guangdong, China
BookMark eNqFkMFqwzAMhs3oYG23N9ghL5DMipM46WFQunUbFHbZYDfj2Aq4pHGx3UHffg7paYftpF9C_4_0LchssAMScg80AwrVwz7rTuHkMMtpXmS0zCgtrsgcap6nHKCckXlc4ylnzdcNWXi_p5QCZzAn2yer7SpZJ17JXrY9JvYYzMH4YFSiMaA7mGHqlB3UyTkc1HnUwdk-OTobrLL9LbnuZO_x7lKX5HP7_LF5TXfvL2-b9S5VrMxD2jHaKiVbljc8CsCW1VCVrNMaGOomDpqa1wxkVYFkuuhqqijDUmPVdAWwJVlNucpZ7x12QpkggxnPkaYXQMVIROzFRESMRAQtRSQSzcUv89GZg3Tn_2yPkw3jY98GnfDKRAqojUMVhLbm74AflLmBZQ
CitedBy_id crossref_primary_10_1145_3715126
Cites_doi 10.1145/170036.170042
10.1145/2213836.2213838
10.1007/s11390-020-9700-5
10.1145/3514221.3526172
10.14778/2809974.2809981
10.1145/3477132.3483591
10.14778/3055540.3055553
10.14778/2535568.2448947
10.14778/3055540.3055548
10.1145/1807128.1807152
10.1145/7239.7266
10.14778/3407790.3407808
10.1007/s11704-023-2605-z
10.1145/3588952
10.1016/j.parco.2022.102980
ContentType Journal Article
Copyright 2024 Elsevier B.V.
Copyright_xml – notice: 2024 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.future.2024.05.004
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7115
EndPage 26
ExternalDocumentID 10_1016_j_future_2024_05_004
S0167739X24002139
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61732022
  funderid: http://dx.doi.org/10.13039/501100001809
– fundername: Shenzhen Science and Technology Program
  grantid: JCYJ20210324132406016; GXWD20220817124827001
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29H
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABJNI
ABMAC
ABXDB
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSZ
T5K
UHS
WUQ
XPP
ZMT
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ADNMO
AEIPS
AFJKZ
AGQPQ
AIIUN
ANKPU
APXCP
CITATION
EFKBS
EFLBG
~HD
ID FETCH-LOGICAL-c352t-f30bccab3297bcc1eb381653fdd13ed91eb987831a661a3d4f80c03e5de69f413
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001241755000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-739X
IngestDate Sat Nov 29 03:48:13 EST 2025
Tue Nov 18 21:00:39 EST 2025
Tue Jun 18 08:51:04 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Transaction processing
Scalability
Distributed database
Deterministic concurrency control
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c352t-f30bccab3297bcc1eb381653fdd13ed91eb987831a661a3d4f80c03e5de69f413
ORCID 0000-0001-6359-7869
0000-0001-8728-3012
0000-0001-6358-2333
OpenAccessLink https://doi.org/10.1016/j.future.2024.05.004
PageCount 12
ParticipantIDs crossref_citationtrail_10_1016_j_future_2024_05_004
crossref_primary_10_1016_j_future_2024_05_004
elsevier_sciencedirect_doi_10_1016_j_future_2024_05_004
PublicationCentury 2000
PublicationDate October 2024
2024-10-00
PublicationDateYYYYMMDD 2024-10-01
PublicationDate_xml – month: 10
  year: 2024
  text: October 2024
PublicationDecade 2020
PublicationTitle Future generation computer systems
PublicationYear 2024
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Stonebraker, Weisberg (b19) 2013; 36
Lu, Yu, Cao, Madden (b4) 2020; 13
Y. Liu, L. Su, V. Shah, Y. Zhou, M.A. Vaz Salles, Hybrid Deterministic and Nondeterministic Execution of Transactions in Actor Systems, in: Proceedings of the 2022 International Conference on Management of Data, 2022, pp. 65–78.
Faleiro, Abadi, Hellerstein (b11) 2017; 10
Faleiro, Abadi (b10) 2015; 8
Wang, Huang (b17) 2022
D. Qin, A.D. Brown, A. Goel, Caracal: Contention Management with Deterministic Concurrency Control, in: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, 2021, pp. 180–194.
Lai, Liu, Lo (b7) 2023; 1
Wang, Peng, Huang (b13) 2024; 18
Leutenegger, Dias (b15) 1993; 22
Harding, Van Aken, Pavlo, Stonebraker (b18) 2017; 10
Xia, Chen, Ma, Huang, Du (b5) 2023
Distributed Transaction Coordination, in: 2012 USENIX Annual Technical Conference, (USENIX ATC 12), 2012, pp. 223–235.
J. Cowling, B. Liskov, Granola
B.F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, R. Sears, Benchmarking cloud serving systems with YCSB, in: Proceedings of the 1st ACM Symposium on Cloud Computing, 2010, pp. 143–154.
A. Thomson, T. Diamond, S.-C. Weng, K. Ren, P. Shao, D.J. Abadi, Calvin: fast distributed transactions for partitioned database systems, in: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, 2012, pp. 1–12.
Shi, Wu, Gao, Zhang (b6) 2021; 33
Dong, Tang, Wang, Wang, Chen, Zang (b12) 2020; 35
Ren, Thomson, Abadi (b1) 2012; 6
Mohan, Lindsay, Obermarck (b2) 1986; 11
Wang (10.1016/j.future.2024.05.004_b13) 2024; 18
Harding (10.1016/j.future.2024.05.004_b18) 2017; 10
Ren (10.1016/j.future.2024.05.004_b1) 2012; 6
10.1016/j.future.2024.05.004_b16
Lu (10.1016/j.future.2024.05.004_b4) 2020; 13
10.1016/j.future.2024.05.004_b14
Wang (10.1016/j.future.2024.05.004_b17) 2022
Lai (10.1016/j.future.2024.05.004_b7) 2023; 1
Xia (10.1016/j.future.2024.05.004_b5) 2023
10.1016/j.future.2024.05.004_b9
Faleiro (10.1016/j.future.2024.05.004_b11) 2017; 10
Dong (10.1016/j.future.2024.05.004_b12) 2020; 35
Faleiro (10.1016/j.future.2024.05.004_b10) 2015; 8
Leutenegger (10.1016/j.future.2024.05.004_b15) 1993; 22
10.1016/j.future.2024.05.004_b8
Mohan (10.1016/j.future.2024.05.004_b2) 1986; 11
Stonebraker (10.1016/j.future.2024.05.004_b19) 2013; 36
10.1016/j.future.2024.05.004_b3
Shi (10.1016/j.future.2024.05.004_b6) 2021; 33
References_xml – volume: 36
  start-page: 21
  year: 2013
  end-page: 27
  ident: b19
  article-title: The VoltDB main memory DBMS
  publication-title: IEEE Data Eng. Bull.
– volume: 22
  start-page: 22
  year: 1993
  end-page: 31
  ident: b15
  article-title: A modeling study of the TPC-C benchmark
  publication-title: ACM Sigmod Rec.
– reference: D. Qin, A.D. Brown, A. Goel, Caracal: Contention Management with Deterministic Concurrency Control, in: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, 2021, pp. 180–194.
– volume: 6
  start-page: 145
  year: 2012
  end-page: 156
  ident: b1
  article-title: Lightweight locking for main memory database systems
  publication-title: Proc. VLDB Endow.
– volume: 1
  start-page: 1
  year: 2023
  end-page: 28
  ident: b7
  article-title: When private blockchain meets deterministic database
  publication-title: Proc. ACM Manag. Data
– volume: 18
  year: 2024
  ident: b13
  article-title: Gria: an efficient deterministic concurrency control protocol
  publication-title: Front. Comput. Sci.
– reference: Y. Liu, L. Su, V. Shah, Y. Zhou, M.A. Vaz Salles, Hybrid Deterministic and Nondeterministic Execution of Transactions in Actor Systems, in: Proceedings of the 2022 International Conference on Management of Data, 2022, pp. 65–78.
– reference: A. Thomson, T. Diamond, S.-C. Weng, K. Ren, P. Shao, D.J. Abadi, Calvin: fast distributed transactions for partitioned database systems, in: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, 2012, pp. 1–12.
– volume: 35
  start-page: 382
  year: 2020
  end-page: 394
  ident: b12
  article-title: Optimistic transaction processing in deterministic database
  publication-title: J. Comput. Sci. Tech.
– volume: 10
  start-page: 553
  year: 2017
  end-page: 564
  ident: b18
  article-title: An evaluation of distributed concurrency control
  publication-title: Proc. VLDB Endow.
– reference: Distributed Transaction Coordination, in: 2012 USENIX Annual Technical Conference, (USENIX ATC 12), 2012, pp. 223–235.
– reference: B.F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, R. Sears, Benchmarking cloud serving systems with YCSB, in: Proceedings of the 1st ACM Symposium on Cloud Computing, 2010, pp. 143–154.
– volume: 8
  year: 2015
  ident: b10
  article-title: Rethinking serializable multiversion concurrency control
  publication-title: Proc. VLDB Endow.
– volume: 11
  start-page: 378
  year: 1986
  end-page: 396
  ident: b2
  article-title: Transaction management in the R* distributed database management system
  publication-title: ACM Trans. Database Syst.
– start-page: 509
  year: 2023
  end-page: 518
  ident: b5
  article-title: Efficient execution of blockchain transactions through deterministic concurrency control
  publication-title: International Conference on Database Systems for Advanced Applications
– volume: 13
  start-page: 2047
  year: 2020
  end-page: 2060
  ident: b4
  article-title: Aria: a fast and practical deterministic OLTP database
  publication-title: Proc. VLDB Endow.
– year: 2022
  ident: b17
  article-title: SGPM: A coroutine framework for transaction processing
  publication-title: Parallel Comput.
– reference: J. Cowling, B. Liskov, Granola:
– volume: 33
  start-page: 4084
  year: 2021
  end-page: 4106
  ident: b6
  article-title: Overview on parallel execution models of smart contract transactions in blockchains
  publication-title: J. Softw.
– volume: 10
  year: 2017
  ident: b11
  article-title: High performance transactions via early write visibility
  publication-title: Proc. VLDB Endow.
– start-page: 509
  year: 2023
  ident: 10.1016/j.future.2024.05.004_b5
  article-title: Efficient execution of blockchain transactions through deterministic concurrency control
– volume: 22
  start-page: 22
  issue: 2
  year: 1993
  ident: 10.1016/j.future.2024.05.004_b15
  article-title: A modeling study of the TPC-C benchmark
  publication-title: ACM Sigmod Rec.
  doi: 10.1145/170036.170042
– ident: 10.1016/j.future.2024.05.004_b9
  doi: 10.1145/2213836.2213838
– volume: 35
  start-page: 382
  issue: 2
  year: 2020
  ident: 10.1016/j.future.2024.05.004_b12
  article-title: Optimistic transaction processing in deterministic database
  publication-title: J. Comput. Sci. Tech.
  doi: 10.1007/s11390-020-9700-5
– ident: 10.1016/j.future.2024.05.004_b3
  doi: 10.1145/3514221.3526172
– volume: 8
  issue: 11
  year: 2015
  ident: 10.1016/j.future.2024.05.004_b10
  article-title: Rethinking serializable multiversion concurrency control
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2809974.2809981
– ident: 10.1016/j.future.2024.05.004_b14
  doi: 10.1145/3477132.3483591
– volume: 36
  start-page: 21
  issue: 2
  year: 2013
  ident: 10.1016/j.future.2024.05.004_b19
  article-title: The VoltDB main memory DBMS
  publication-title: IEEE Data Eng. Bull.
– volume: 10
  issue: 5
  year: 2017
  ident: 10.1016/j.future.2024.05.004_b11
  article-title: High performance transactions via early write visibility
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3055540.3055553
– volume: 6
  start-page: 145
  issue: 2
  year: 2012
  ident: 10.1016/j.future.2024.05.004_b1
  article-title: Lightweight locking for main memory database systems
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2535568.2448947
– volume: 10
  start-page: 553
  issue: 5
  year: 2017
  ident: 10.1016/j.future.2024.05.004_b18
  article-title: An evaluation of distributed concurrency control
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3055540.3055548
– ident: 10.1016/j.future.2024.05.004_b16
  doi: 10.1145/1807128.1807152
– volume: 11
  start-page: 378
  issn: 0362-5915
  issue: 4
  year: 1986
  ident: 10.1016/j.future.2024.05.004_b2
  article-title: Transaction management in the R* distributed database management system
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/7239.7266
– volume: 13
  start-page: 2047
  issue: 12
  year: 2020
  ident: 10.1016/j.future.2024.05.004_b4
  article-title: Aria: a fast and practical deterministic OLTP database
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3407790.3407808
– ident: 10.1016/j.future.2024.05.004_b8
– volume: 18
  issue: 4
  year: 2024
  ident: 10.1016/j.future.2024.05.004_b13
  article-title: Gria: an efficient deterministic concurrency control protocol
  publication-title: Front. Comput. Sci.
  doi: 10.1007/s11704-023-2605-z
– volume: 1
  start-page: 1
  issue: 1
  year: 2023
  ident: 10.1016/j.future.2024.05.004_b7
  article-title: When private blockchain meets deterministic database
  publication-title: Proc. ACM Manag. Data
  doi: 10.1145/3588952
– year: 2022
  ident: 10.1016/j.future.2024.05.004_b17
  article-title: SGPM: A coroutine framework for transaction processing
  publication-title: Parallel Comput.
  doi: 10.1016/j.parco.2022.102980
– volume: 33
  start-page: 4084
  issue: 11
  year: 2021
  ident: 10.1016/j.future.2024.05.004_b6
  article-title: Overview on parallel execution models of smart contract transactions in blockchains
  publication-title: J. Softw.
SSID ssj0001731
Score 2.4296029
Snippet Deterministic concurrency control is able to avoid the expensive two-phase commit in distributed databases and can solve the single-thread bottleneck of...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 15
SubjectTerms Deterministic concurrency control
Distributed database
Scalability
Transaction processing
Title Dodo: A scalable optimistic deterministic concurrency control protocol
URI https://dx.doi.org/10.1016/j.future.2024.05.004
Volume 159
WOSCitedRecordID wos001241755000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7115
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001731
  issn: 0167-739X
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9tAEF6Fx4ELUCjiWe2BW2Vkex3W5hYBEa0qhFSqpifL-0KJgo0gQXDgvzPrnXVSgvpA4hI5a2-ymvkyO7OZ-YaQ_cTIqFChCGJZxAHsEGAHlTFBIWE7k4XhmTB1swl-fp72etlFq_Xka2Huh7ws04eH7OZdVQ1joGxbOvsf6m4-FAbgGpQOr6B2eP0nxZ9AoOnqze9A_nVlVAV24bpmZP6sMP3FvYNgWNYETfKxSVq3zA2VrIbTbmu3Zh6x7ZY1IkZiNwikgm488594_tzrl4_jCfIutBv-NS4nQMJHz_SgX1R--Fsfp18BnMrpQ4k4adLb8KRsplrGHV6CUeasbp0Le48zuCkHDz9yJZ2NRUaScGdT8Z7bnV15_Yzdd0cQgwNHxHJgl1QTsrrWxi8Ytb_bhdh12PzZGFzgObIQ83YGRnGh8-W097XZyiOODS1x4b72sk4QnP2u132bKX_lcpUsY6BBOw4gH0hLl2tkxTfxoGjT10nX4uWIdqhHC52ghf6GFjqFFopooR4tH8mP7unl8VmAzTUCCT73KDAsFPDrFSzOOFxEWti_kNvMKBUxrTIYyFKesqgAD65gKjFpKEOm20ofZgZcnw0yX1al3iT0EO7ISDGIVONEKiFSoUTMiwRiew0RxRZhXiy5ROZ52wBlmPsUw0HuhJlbYeZhOwdhbpGgmXXjmFf-8jz3Es_Re3ReYQ4g-ePM7TfP3CFLE_TvkvnR7VjvkUV5P-rf3X5CND0DM3WaVw
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Dodo%3A+A+scalable+optimistic+deterministic+concurrency+control+protocol&rft.jtitle=Future+generation+computer+systems&rft.au=Wang%2C+Xinyuan&rft.au=Peng%2C+Yun&rft.au=Huang%2C+Hejiao&rft.au=Li%2C+Xingchen&rft.date=2024-10-01&rft.pub=Elsevier+B.V&rft.issn=0167-739X&rft.eissn=1872-7115&rft.volume=159&rft.spage=15&rft.epage=26&rft_id=info:doi/10.1016%2Fj.future.2024.05.004&rft.externalDocID=S0167739X24002139
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-739X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-739X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-739X&client=summon