Gria: an efficient deterministic concurrency control protocol

Deterministic databases are able to reduce coordination costs in a replication. This property has fostered a significant interest in the design of efficient deterministic concurrency control protocols. However, the state-of-the-art deterministic concurrency control protocol Aria has three issues. Fi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Frontiers of Computer Science Ročník 18; číslo 4; s. 184204
Hlavní autoři: WANG, Xinyuan, PENG, Yun, HUANG, Hejiao
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Higher Education Press 01.08.2024
Springer Nature B.V
Témata:
ISSN:2095-2228, 2095-2236
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 databases are able to reduce coordination costs in a replication. This property has fostered a significant interest in the design of efficient deterministic concurrency control protocols. However, the state-of-the-art deterministic concurrency control protocol Aria has three issues. First, it is impractical to configure a suitable batch size when the read-write set is unknown. Second, Aria running in low-concurrency scenarios, e.g., a single-thread scenario, suffers from the same conflicts as running in high-concurrency scenarios. Third, the single-version schema brings write-after-write conflicts. To address these issues, we propose Gria, an efficient deterministic concurrency control protocol. Gria has the following properties. First, the batch size of Gria is auto-scaling. Second, Gria's conflict probability in low-concurrency scenarios is lower than that in high-concurrency scenarios. Third, Gria has no write-after-write conflicts by adopting a multi-version structure. To further reduce conflicts, we propose two optimizations: a reordering mechanism as well as a rechecking strategy. The evaluation result on two popular benchmarks shows that Gria outperforms Aria by 13x.
AbstractList Deterministic databases are able to reduce coordination costs in a replication. This property has fostered a significant interest in the design of efficient deterministic concurrency control protocols. However, the state-of-the-art deterministic concurrency control protocol Aria has three issues. First, it is impractical to configure a suitable batch size when the read-write set is unknown. Second, Aria running in low-concurrency scenarios, e.g., a single-thread scenario, suffers from the same conflicts as running in high-concurrency scenarios. Third, the single-version schema brings write-after-write conflicts.To address these issues, we propose Gria, an efficient deterministic concurrency control protocol. Gria has the following properties. First, the batch size of Gria is auto-scaling. Second, Gria’s conflict probability in low-concurrency scenarios is lower than that in high-concurrency scenarios. Third, Gria has no write-after-write conflicts by adopting a multi-version structure. To further reduce conflicts, we propose two optimizations: a reordering mechanism as well as a rechecking strategy. The evaluation result on two popular benchmarks shows that Gria outperforms Aria by 13x.
Deterministic databases are able to reduce coordination costs in a replication. This property has fostered a significant interest in the design of efficient deterministic concurrency control protocols. However, the state-of-the-art deterministic concurrency control protocol Aria has three issues. First, it is impractical to configure a suitable batch size when the read-write set is unknown. Second, Aria running in low-concurrency scenarios, e.g., a single-thread scenario, suffers from the same conflicts as running in high-concurrency scenarios. Third, the single-version schema brings write-after-write conflicts. To address these issues, we propose Gria, an efficient deterministic concurrency control protocol. Gria has the following properties. First, the batch size of Gria is auto-scaling. Second, Gria's conflict probability in low-concurrency scenarios is lower than that in high-concurrency scenarios. Third, Gria has no write-after-write conflicts by adopting a multi-version structure. To further reduce conflicts, we propose two optimizations: a reordering mechanism as well as a rechecking strategy. The evaluation result on two popular benchmarks shows that Gria outperforms Aria by 13x.
ArticleNumber 184204
Author WANG, Xinyuan
HUANG, Hejiao
PENG, Yun
Author_xml – sequence: 1
  givenname: Xinyuan
  surname: WANG
  fullname: WANG, Xinyuan
  organization: School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen 518055, China
– sequence: 2
  givenname: Yun
  surname: PENG
  fullname: PENG, Yun
  organization: Institute of Artificial Intelligence and Blockchain, Guangzhou University, Guangzhou 510006, China
– sequence: 3
  givenname: Hejiao
  surname: HUANG
  fullname: HUANG, Hejiao
  email: huanghejiao@hit.edu.cn
  organization: School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen 518055, China
BookMark eNp9kDFPwzAUhC0EEqX0B7BFYg7YL3HiIDGgCgpSJRaYLcd5aV2ldrHdof31JAoCiaHTu-G-d6e7IufWWSTkhtE7Rml5HxgraZ5SyFIoKE-PZ2QCtOIpQFac_2oQl2QWwoZSChQ4B5iQx4U36iFRNsG2NdqgjUmDEf3WWBOi0Yl2Vu-9R6sPg47edcnOu-i0667JRau6gLOfOyWfL88f89d0-b54mz8tU50VPKa8yikH0Sje1Dmqsq1qXWOlFWSUs7aCWjQ5z0XZYA66KgQDoTKtRdMUVZm12ZTcjn_74K89hig3bu9tHymhYqIEKCDvXeXo0t6F4LGV2kQVzVBamU4yKoe55DiX7OeSw1zy2JPsH7nzZqv84SQDIxN6r12h_-t0ChIjtDarNXpsdh5DkK3vOxr0p9BvXmSReg
CitedBy_id crossref_primary_10_1016_j_future_2024_05_004
crossref_primary_10_1145_3715126
crossref_primary_10_1038_s41598_025_00478_5
Cites_doi 10.1145/2556685
10.1145/3035918.3064015
10.1145/225535.225538
10.1145/3477132.3483591
10.14778/2809974.2809981
10.14778/3055540.3055553
10.14778/1687627.1687658
10.14778/1920841.1920855
10.14778/3407790.3407808
10.14778/3067421.3067427
10.1145/1282480.1282513
10.1007/978-1-4842-4923-9
10.1145/2213836.2213838
10.1145/2517349.2522713
10.1145/2882903.2882935
10.1145/360363.360369
10.14778/3342263.3342639
10.1145/170036.170042
10.1145/1807128.1807152
ContentType Journal Article
Copyright Copyright reserved, 2024, Higher Education Press
Higher Education Press 2024
Higher Education Press 2024.
Copyright_xml – notice: Copyright reserved, 2024, Higher Education Press
– notice: Higher Education Press 2024
– notice: Higher Education Press 2024.
DBID AAYXX
CITATION
8FE
8FG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOI 10.1007/s11704-023-2605-z
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle CrossRef
Advanced Technologies & Aerospace Collection
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Advanced Technologies & Aerospace Collection


Database_xml – sequence: 1
  dbid: P5Z
  name: Advanced Technologies & Aerospace Database
  url: https://search.proquest.com/hightechjournals
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2095-2236
ExternalDocumentID 10_1007_s11704_023_2605_z
10.1007/s11704-023-2605-z
GroupedDBID -EM
-~C
.VR
06D
0VY
1-T
2J2
2JN
2JY
2KG
2KM
2LR
30V
4.4
406
408
40E
5VS
95-
95.
96X
AABHQ
AAFGU
AAIAL
AAJKR
AANZL
AAPBV
AARHV
AARTL
AATLR
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
ABDZT
ABECU
ABFGW
ABFTD
ABFTV
ABHQN
ABJOX
ABKAS
ABKCH
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTMW
ABWNU
ABXPI
ACBMV
ACBRV
ACBXY
ACGFS
ACHSB
ACHXU
ACIPQ
ACKNC
ACMDZ
ACMLO
ACOKC
ACSNA
ACTTH
ACVWB
ACWMK
ADHIR
ADINQ
ADKNI
ADKPE
ADMDM
ADOXG
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFTE
AEGNC
AEJHL
AEJRE
AEKMD
AENEX
AEOHA
AEPYU
AESTI
AETLH
AEVTX
AEXYK
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGBP
AGJBK
AGMZJ
AGQMX
AGWIL
AGWZB
AGYKE
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIIXL
AILAN
AIMYW
AITGF
AJBLW
AJDOV
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMYLF
AOCGG
ARMRJ
AXYYD
B-.
BDATZ
BGNMA
CSCUP
DNIVK
EBLON
EBS
EIOEI
EJD
ESBYG
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
H13
HF~
HG6
HMJXF
HRMNR
HZ~
IKXTQ
IWAJR
IXD
I~Z
J-C
JBSCW
JZLTJ
KOV
LLZTM
M4Y
MA-
NPVJJ
NQJWS
NU0
O9J
P4S
PF0
PT4
R89
ROL
RSV
S16
S3B
SAP
SCL
SCO
SHX
SISQX
SNE
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
TSG
TUC
UG4
UNUBA
UOJIU
UTJUX
UZXMN
VFIZW
W48
YLTOR
Z7R
Z7X
Z81
Z83
Z88
ZMTXR
-SI
-S~
0R~
AACDK
AAJBT
AAPKM
AASML
AATNV
AAXDM
AAYZH
ABAKF
ABBRH
ABDBE
ABFSG
ABJNI
ABRTQ
ABTKH
ACAOD
ACDTI
ACPIV
ACSTC
ACZOJ
AEFQL
AEMSY
AESKC
AEVLU
AEZWR
AFBBN
AFDZB
AFHIU
AFKRA
AFOHR
AGQEE
AGRTI
AHPBZ
AHWEU
AIGIU
AIXLP
AMXSW
ARAPS
ATHPR
AYFIA
BENPR
BGLVJ
CAJEI
CCPQU
DDRTE
DPUIP
HCIFZ
K7-
PHGZM
PHGZT
PQGLB
PUEGO
Q--
SJYHP
SNPRN
U1G
U5S
AAYXX
AFFHD
BSONS
CITATION
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c365t-5940528da5db4ea7f9bcbe9ca23051f92b8d45487de42c968128a3cc8dd6973f3
IEDL.DBID K7-
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001130364200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2095-2228
IngestDate Fri Nov 07 23:37:05 EST 2025
Tue Nov 18 21:02:34 EST 2025
Sat Nov 29 07:29:58 EST 2025
Sat Sep 20 01:10:36 EDT 2025
Mon Jul 03 22:10:29 EDT 2023
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords transaction processing
deterministic concurrency control
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c365t-5940528da5db4ea7f9bcbe9ca23051f92b8d45487de42c968128a3cc8dd6973f3
Notes transaction processing
Document received on :2022-09-29
Document accepted on :2023-04-10
deterministic concurrency control
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2918722624
PQPubID 2044369
ParticipantIDs proquest_journals_2918722624
crossref_citationtrail_10_1007_s11704_023_2605_z
crossref_primary_10_1007_s11704_023_2605_z
springer_journals_10_1007_s11704_023_2605_z
higheredpress_frontiers_10_1007_s11704_023_2605_z
PublicationCentury 2000
PublicationDate 2024-08-01
PublicationDateYYYYMMDD 2024-08-01
PublicationDate_xml – month: 08
  year: 2024
  text: 2024-08-01
  day: 01
PublicationDecade 2020
PublicationPlace Beijing
PublicationPlace_xml – name: Beijing
– name: Heidelberg
PublicationTitle Frontiers of Computer Science
PublicationTitleAbbrev Front. Comput. Sci
PublicationYear 2024
Publisher Higher Education Press
Springer Nature B.V
Publisher_xml – name: Higher Education Press
– name: Springer Nature B.V
References A Thomson (2605_CR4) 2014; 39
Y Lu (2605_CR1) 2020; 13
K P Eswaran (2605_CR22) 1976; 19
T C Bressoud (2605_CR23) 1996; 14
J M Faleiro (2605_CR9) 2017; 10
2605_CR12
D Lomet (2605_CR20) 2009; 2
Y Wu (2605_CR10) 2017; 10
2605_CR11
2605_CR21
A Thomson (2605_CR3) 2010; 3
2605_CR7
2605_CR17
2605_CR16
2605_CR5
2605_CR15
2605_CR6
J M Faleiro (2605_CR8) 2015; 8
2605_CR14
2605_CR19
E Zamanian (2605_CR2) 2019; 12
S T Leutenegger (2605_CR13) 1993; 22
2605_CR18
References_xml – volume: 39
  start-page: 11
  issue: 2
  year: 2014
  ident: 2605_CR4
  publication-title: ACM Transactions on Database Systems
  doi: 10.1145/2556685
– ident: 2605_CR16
  doi: 10.1145/3035918.3064015
– volume: 14
  start-page: 80
  issue: 1
  year: 1996
  ident: 2605_CR23
  publication-title: ACM Transactions on Computer Systems
  doi: 10.1145/225535.225538
– ident: 2605_CR15
  doi: 10.1145/3477132.3483591
– ident: 2605_CR17
– volume: 8
  start-page: 1190
  issue: 11
  year: 2015
  ident: 2605_CR8
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/2809974.2809981
– ident: 2605_CR21
– volume: 10
  start-page: 613
  issue: 5
  year: 2017
  ident: 2605_CR9
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/3055540.3055553
– volume: 2
  start-page: 265
  issue: 1
  year: 2009
  ident: 2605_CR20
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/1687627.1687658
– volume: 3
  start-page: 70
  issue: 1–2
  year: 2010
  ident: 2605_CR3
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/1920841.1920855
– volume: 13
  start-page: 2047
  issue: 12
  year: 2020
  ident: 2605_CR1
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/3407790.3407808
– volume: 10
  start-page: 781
  issue: 7
  year: 2017
  ident: 2605_CR10
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/3067421.3067427
– ident: 2605_CR19
  doi: 10.1145/1282480.1282513
– ident: 2605_CR18
  doi: 10.1007/978-1-4842-4923-9
– ident: 2605_CR7
  doi: 10.1145/2213836.2213838
– ident: 2605_CR11
  doi: 10.1145/2517349.2522713
– ident: 2605_CR12
  doi: 10.1145/2882903.2882935
– volume: 19
  start-page: 624
  issue: 11
  year: 1976
  ident: 2605_CR22
  publication-title: Communications of the ACM
  doi: 10.1145/360363.360369
– ident: 2605_CR5
– volume: 12
  start-page: 1637
  issue: 11
  year: 2019
  ident: 2605_CR2
  publication-title: Proceedings of the VLDB Endowment
  doi: 10.14778/3342263.3342639
– ident: 2605_CR6
– volume: 22
  start-page: 22
  issue: 2
  year: 1993
  ident: 2605_CR13
  publication-title: ACM SIGMOD Record
  doi: 10.1145/170036.170042
– ident: 2605_CR14
  doi: 10.1145/1807128.1807152
SSID ssj0002025522
Score 2.349982
Snippet Deterministic databases are able to reduce coordination costs in a replication. This property has fostered a significant interest in the design of efficient...
SourceID proquest
crossref
springer
higheredpress
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 184204
SubjectTerms Computer Science
Concurrency
Concurrency control
deterministic concurrency control
Protocol
Research Article
transaction processing
SummonAdditionalLinks – databaseName: Springer Nature - Connect here FIRST to enable access
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5aPQhifWK1Sg6elICb7CMRPIj4OEgR1NJbyBMF2UpbBfvrTbLZlooW9LxJWGYmmW8yk28AOLIkS4RzQyiV_kkOdXGKyHODvL-wwipc3Xd074pOh_Z67D6-4x7W1e51SjKc1NPHbknhKyYwQR6Do_EiWMo82YwP0R-6k4sV7FFyyB5gBx-Qv-Gos5k_rTLjj1afQ3GF0aEIdQZ0fsuTBvdz3fzXj6-DtYg24UVlHhtgwZSboFl3coBxY2-B8xtnh2dQlNAESgnniaCOhTKByRm6sFkFKif1CWN5O_QcD31nSNvg6frq8fIWxcYKSJE8G6GMOZiGqRaZlqkRhWVSScOUcJrJEsuwpDr1oYw2KVbMU5RRQZSiWudO4JbsgEbZL80ugFalgllFiBuREiOFoNLkIlE0E0oL2QKntXi5iqzjvvnFK5_yJXvxcCce7sXDxy1wPJnyVlFuzBuczOiMW8_74LuIz5vTrvXK444dcswSWjgsitMWOKn1OP3862J7fxq9D1acfaZVBWEbNEaDd3MAltXH6GU4OAyG_AU6tO1w
  priority: 102
  providerName: Springer Nature
Title Gria: an efficient deterministic concurrency control protocol
URI https://journal.hep.com.cn/fcs/EN/10.1007/s11704-023-2605-z
https://link.springer.com/article/10.1007/s11704-023-2605-z
https://www.proquest.com/docview/2918722624
Volume 18
WOSCitedRecordID wos001130364200005&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: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2095-2236
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 2095-2228
  databaseCode: P5Z
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2095-2236
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 2095-2228
  databaseCode: K7-
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2095-2236
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 2095-2228
  databaseCode: BENPR
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer Nature - Connect here FIRST to enable access
  customDbUrl:
  eissn: 2095-2236
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 2095-2228
  databaseCode: RSV
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LTxsxEB7R0EMlBPSBCC_50FMrq117HzYSQoACHKooStso6mXl9UMgoQ0kAQl-PR7HS5RK5MLFFz-k3W_sGc-MvwH46niWKK-GaFrhkxzh7ykqzy1FfeGU02zm7xj8KrpdMRzKXnS4TWJaZXMmhoPajDT6yH8wmYjC2wosPb69o1g1CqOrsYTGO1hNmD-EMShb0BcfC0ODOQQSmLckKDo7msBmeD2XFJiCwThFo54-LaimtauQZ2FNyEddsD__C5kGTXS-8dZv2IT1aIOSk5nQfIQVW3-Cjaa-A4nb_TMcXXjpPCSqJjYQTXj9RExMnwn8zsRfpnUgeNKPJCa9E2R-GHnx-gJ_zzt_zi5pLLdANc-zKc2kN96YMCozVWpV4WSlKyu18nhliZOsEibFC46xKdMSicuE4loLY3JZcMe3oFWParsNxOlUSac59yNSbiulRGVzlWiRKW1U1YafzZ8udeQix5IYN-WcRRnBKT04JYJTPrXh28uU2xkRx7LByQJ8pUM2CKwtvmzOXgNaGffxpJwj1obvDezz7lcX21m-2C588LKZzhIJ96A1Hd_bfXivH6bXk_EBrJ52ur3-QRBm3_ayf77t_x48AyMK-rs
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bTxQxFD7BxUQSA3ghrqL0QV80jU7bmWlNiAEFIawbYtDwVju9RBMzi-wKgR_Fb7SnM8NmTdw3HnyetpmZfufSc06_A_A88Dwz0QxRUeGVHBnPKaYoPEV7EUywrIl3fB2Uw6E8PlaHC3DV3YXBsspOJyZF7UYWY-SvmcpkGX0FJt6d_KLYNQqzq10LjQYWB_7iPB7Zxpv7H-L-vmBsd-fo_R5tuwpQy4t8QnMVfRQmncldJbwpg6ps5ZU18bXyLChWSSfQj3deMKuQn0sabq10rlAlDzyuewsWBRdF3oPF7Z3h4efrqA5DFz2lLlj0XSiGV7pUarqvl5VY9ME4xWMEvZwxhne_p8oO71IF7IzH-1eSNtm-3ZX_7a-twnLrZZOtRizuwYKv78NK18GCtArtAWx-jPL3lpia-ESlES0wcW2BUGKwJnZU20RhZS9IW9ZPkNtiFAXoIXy5kY9Yg149qv0jIMEKo4LlPI4Q3FfGyMoXJrMyN9aZqg9vup3VtmVbx6YfP_WUJxrBoCMYNIJBX_bh5fWUk4ZqZN7gbAYuOiDfBXZPnzdnvQOJbjXVWE8R0odXHcymj_-52OP5i23Anb2jTwM92B8ePIGlKBeiKZtch97k9Ld_Crft2eTH-PRZK0IEvt00_v4A7pVWLQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZSwMxEB68EEGsJ1ar5sEnZdFNsruJ4IOoVbEU8Si-hWwOFGQVWwX76032aKmoID5vNsvOTJgvmS_fAGxbEoXSpaGApv5KDnP7FBnHJvD5wkqrcHHe0Wkl7Ta7v-dXZZ_TbsV2r0qSxZ0Gr9KU9fZetN0bXnwLE8-ewCTweDzoj8MkdRsZz-m6vukMDlmwR8x5JQE7KBH4046qsvndLCO5afYhJ1oYnRNSRwDol5ppnoqatX__xDzMlSgUHRVhswBjJluEWtXhAZULfgkOz1x8HiCZIZNLTbjJkS4JNLnCM3KfVLnEk_pAJe0dee2HZxdgy3DXPL09Pg_KhguBInHUCyLu4BtmWkY6pUYmlqcqNVxJ57EotBynTFO_xdGGYsW9dBmTRCmmdcwTYskKTGTPmVkFZBWV3CpC3AhKTColS00sQ8UiqbRM67BfmVqoUo3cN8V4EkMdZW8e4cwjvHlEvw47g1deCimO3waHI_4T1utB-O7iv73TqHwsypXcFZiHLHEYFdM67FY-HT7-cbK1P43egumrk6ZoXbQv12HGhS0tSIYNmOi9vpkNmFLvvcfu62Ye359Ktfk4
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=Gria%3A+an+efficient+deterministic+concurrency+control+protocol&rft.jtitle=Frontiers+of+Computer+Science&rft.au=Wang%2C+Xinyuan&rft.au=Peng%2C+Yun&rft.au=Huang%2C+Hejiao&rft.date=2024-08-01&rft.pub=Springer+Nature+B.V&rft.issn=2095-2228&rft.eissn=2095-2236&rft.volume=18&rft.issue=4&rft.spage=184204&rft_id=info:doi/10.1007%2Fs11704-023-2605-z
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2095-2228&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2095-2228&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2095-2228&client=summon