EPO‐R: An efficient garbage collection scheme for long‐term transactions

Summary This article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a version for each update operation, and it can exhaust physical memory for dynamically changing environments such as IoT payments. Eag...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Concurrency and computation Jg. 36; H. 17
Hauptverfasser: Onishi, Rina, Hoshino, Takashi, Kawashima, Hideyuki
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken Wiley Subscription Services, Inc 01.08.2024
Schlagworte:
ISSN:1532-0626, 1532-0634
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Summary This article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a version for each update operation, and it can exhaust physical memory for dynamically changing environments such as IoT payments. Eager pruning of obsolete versions (EPO) is a novel garbage collection technique for long‐term transactions. We found room for improvement in EPO, which triggers reclamation invocation. EPO is triggered for each write operation, and it wastes CPU resources. The proposed method EPO‐R is triggered on a read operation to address this issue. The result of experiments with 64 CPU cores and workloads with the combination of short‐term and long‐term transactions demonstrated that EPO‐R exhibited 6.3 times higher throughput than that of EPO. The reason for this can be explained by analyzing the number of unreclaimable versions.
AbstractList Summary This article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a version for each update operation, and it can exhaust physical memory for dynamically changing environments such as IoT payments. Eager pruning of obsolete versions (EPO) is a novel garbage collection technique for long‐term transactions. We found room for improvement in EPO, which triggers reclamation invocation. EPO is triggered for each write operation, and it wastes CPU resources. The proposed method EPO‐R is triggered on a read operation to address this issue. The result of experiments with 64 CPU cores and workloads with the combination of short‐term and long‐term transactions demonstrated that EPO‐R exhibited 6.3 times higher throughput than that of EPO. The reason for this can be explained by analyzing the number of unreclaimable versions.
This article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a version for each update operation, and it can exhaust physical memory for dynamically changing environments such as IoT payments. Eager pruning of obsolete versions (EPO) is a novel garbage collection technique for long‐term transactions. We found room for improvement in EPO, which triggers reclamation invocation. EPO is triggered for each write operation, and it wastes CPU resources. The proposed method EPO‐R is triggered on a read operation to address this issue. The result of experiments with 64 CPU cores and workloads with the combination of short‐term and long‐term transactions demonstrated that EPO‐R exhibited 6.3 times higher throughput than that of EPO. The reason for this can be explained by analyzing the number of unreclaimable versions.
Author Hoshino, Takashi
Kawashima, Hideyuki
Onishi, Rina
Author_xml – sequence: 1
  givenname: Rina
  orcidid: 0009-0000-5324-2554
  surname: Onishi
  fullname: Onishi, Rina
  email: rina.onishi2951@keio.jp
  organization: Keio University
– sequence: 2
  givenname: Takashi
  surname: Hoshino
  fullname: Hoshino, Takashi
  organization: Cybozu Labs, Inc
– sequence: 3
  givenname: Hideyuki
  surname: Kawashima
  fullname: Kawashima, Hideyuki
  organization: Keio University
BookMark eNp1kM1KAzEURoNUsFbBRwi4cTM1mUwyjbtS6g8UWkTXIU1u6pRpUpMp0p2P4DP6JE5bcSG6undxzr0f3ynq-OABoQtK-pSQ_NqsoT-grDhCXcpZnhHBis7PnosTdJrSkhBKCaNdNBnPpp_vH483eOgxOFeZCnyDFzrO9QKwCXUNpqmCx8m8wAqwCxHXwS9aqYG4wk3UPuk9ks7QsdN1gvPv2UPPt-On0X02md49jIaTzLC8LDIOJTFzaS3jkktNqBTCOl0QC1RrKwsoRencnFooBFhBBgPJgJZGSs65ZayHLg931zG8biA1ahk20bcvFSNlLgXjQrRU_0CZGFKK4JSpGr0L2mauakWJ2jWm2sbUrrFWuPolrGO10nH7F5od0Leqhu2_nBrNxnv-C3lcfSU
CitedBy_id crossref_primary_10_1016_j_ins_2025_122032
crossref_primary_10_1016_j_ins_2025_122077
crossref_primary_10_1016_j_ins_2025_122100
crossref_primary_10_1002_cpe_70145
crossref_primary_10_1016_j_ins_2025_122191
crossref_primary_10_1002_cpe_70076
crossref_primary_10_1016_j_ins_2025_122192
Cites_doi 10.1145/2771937.2771949
10.14778/3067421.3067427
10.1145/1620585.1620587
10.14778/2809974.2809981
10.1145/2723372.2746480
10.1145/2882903.2882935
10.1201/9781315388021
10.3897/jucs.2020.006
10.1109/BigComp54360.2022.00060
10.14778/3554821.3554832
10.1145/3448016.3457294
10.1145/1071610.1071615
10.1145/2517349.2522713
10.1145/2463676.2463710
10.14778/3015274.3015276
10.1145/3477132.3483591
10.1109/IROS47612.2022.9981089
10.1145/2213836.2213838
10.14778/2367502.2367523
10.14778/2735508.2735511
10.1145/223784.223785
10.2197/ipsjjip.30.552
10.1145/3035918.3064015
10.1145/2882903.2903734
10.14778/3424573.3424575
10.14778/3364324.3364328
ContentType Journal Article
Copyright 2024 The Authors. published by John Wiley & Sons Ltd.
2024. This article is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2024 The Authors. published by John Wiley & Sons Ltd.
– notice: 2024. This article is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 24P
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1002/cpe.8134
DatabaseName Wiley Online Library Open Access (WRLC)
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
CrossRef
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: 24P
  name: Wiley Online Library Open Access
  url: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1532-0634
EndPage n/a
ExternalDocumentID 10_1002_cpe_8134
CPE8134
Genre article
GrantInformation_xml – fundername: New Energy and Industrial Technology Development Organization (NEDO)
  funderid: JPNP16007
– fundername: Research and Development Project of the Enhanced Infrastructures for Post‐5G Information and Communication Systems
  funderid: JPNP20017
– fundername: JSPS KAKENHI
  funderid: 22H03596
GroupedDBID .3N
.DC
.GA
05W
0R~
10A
1L6
1OC
24P
33P
3SF
3WU
4.4
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5GY
5VS
66C
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
930
A03
AAESR
AAEVG
AAHHS
AAHQN
AAMNL
AANLZ
AAONW
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABEML
ABIJN
ACAHQ
ACCFJ
ACCZN
ACPOU
ACSCC
ACXBN
ACXQS
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADOZA
ADXAS
ADZMN
ADZOD
AEEZP
AEIGN
AEIMD
AEQDE
AEUQT
AEUYR
AFBPY
AFFPM
AFGKR
AFPWT
AFWVQ
AHBTC
AITYG
AIURR
AIWBW
AJBDE
AJXKR
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ATUGU
AUFTA
AZBYB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BROTX
BRXPI
BY8
CS3
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
EBS
F00
F01
F04
F5P
G-S
G.N
GNP
GODZA
HGLYW
HHY
HZ~
IX1
JPC
KQQ
LATKE
LAW
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LYRES
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
N9A
O66
O9-
OIG
P2W
P2X
P4D
PQQKQ
Q.N
Q11
QB0
QRW
R.K
ROL
RWI
RX1
SUPJJ
TN5
UB1
V2E
W8V
W99
WBKPD
WIH
WIK
WOHZO
WQJ
WRC
WXSBR
WYISQ
WZISG
XG1
XV2
~IA
~WT
.Y3
31~
AANHP
AASGY
AAYXX
ACBWZ
ACRPL
ACYXJ
ADMLS
ADNMO
AEYWJ
AFZJQ
AGHNM
AGQPQ
AGYGG
ASPBG
AVWKF
AZFZN
CITATION
EJD
FEDTE
HF~
HVGLF
LW6
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c3274-5e70cb9dd35959a01966dfa40de1aad94e767ffb1de46ed608893e17c99555d33
IEDL.DBID 24P
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001214142400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1532-0626
IngestDate Fri Jul 25 06:47:34 EDT 2025
Tue Nov 18 20:55:50 EST 2025
Sat Nov 29 03:49:55 EST 2025
Wed Jan 22 17:18:35 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 17
Language English
License Attribution
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3274-5e70cb9dd35959a01966dfa40de1aad94e767ffb1de46ed608893e17c99555d33
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0009-0000-5324-2554
OpenAccessLink https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.8134
PQID 3072963566
PQPubID 2045170
PageCount 16
ParticipantIDs proquest_journals_3072963566
crossref_citationtrail_10_1002_cpe_8134
crossref_primary_10_1002_cpe_8134
wiley_primary_10_1002_cpe_8134_CPE8134
PublicationCentury 2000
PublicationDate 1 August 2024
2024-08-00
20240801
PublicationDateYYYYMMDD 2024-08-01
PublicationDate_xml – month: 08
  year: 2024
  text: 1 August 2024
  day: 01
PublicationDecade 2020
PublicationPlace Hoboken
PublicationPlace_xml – name: Hoboken
PublicationTitle Concurrency and computation
PublicationYear 2024
Publisher Wiley Subscription Services, Inc
Publisher_xml – name: Wiley Subscription Services, Inc
References 2009; 34
2001
2012
2022
2011
2021
2019; 13
2017; 10
2016; 10
2005; 30
2020; 26
2017
2022; 15
1995
2016
2020; 13
2015
2013
2014; 8
2015; 8
2012; 5
e_1_2_11_32_1
e_1_2_11_31_1
e_1_2_11_30_1
e_1_2_11_36_1
e_1_2_11_14_1
e_1_2_11_13_1
e_1_2_11_35_1
e_1_2_11_12_1
e_1_2_11_34_1
e_1_2_11_11_1
e_1_2_11_33_1
e_1_2_11_7_1
e_1_2_11_29_1
e_1_2_11_6_1
e_1_2_11_28_1
e_1_2_11_27_1
e_1_2_11_4_1
e_1_2_11_26_1
e_1_2_11_2_1
Ogura T (e_1_2_11_3_1) 2021
Nakamori T (e_1_2_11_16_1) 2022
Weikum G (e_1_2_11_5_1) 2001
Neumann T (e_1_2_11_10_1) 2015
e_1_2_11_21_1
e_1_2_11_20_1
e_1_2_11_25_1
e_1_2_11_24_1
e_1_2_11_9_1
e_1_2_11_23_1
e_1_2_11_8_1
e_1_2_11_22_1
e_1_2_11_18_1
e_1_2_11_17_1
e_1_2_11_15_1
e_1_2_11_19_1
References_xml – year: 2011
– start-page: 9722
  year: 2022
  end-page: 9727
– volume: 13
  start-page: 128
  issue: 2
  year: 2019
  end-page: 141
  article-title: Scalable garbage collection for in‐memory mvcc systems
  publication-title: Proc VLDB Endow
– start-page: 677
  year: 2015
  end-page: 689
– start-page: 1
  year: 2015
  end-page: 8
– start-page: 1
  year: 2012
  end-page: 12
– start-page: 2390
  year: 2021
  end-page: 2399
– year: 2001
– start-page: 658
  year: 2021
  end-page: 670
– start-page: 180
  year: 2021
  end-page: 194
– volume: 8
  start-page: 1190
  issue: 11
  year: 2015
  end-page: 1201
  article-title: Rethinking serializable multiversion concurrency control
  publication-title: Proc VLDB Endow
– volume: 26
  start-page: 89
  issue: 1
  year: 2020
  end-page: 106
  article-title: Scalable distributed metadata server based on nonblocking transactions
  publication-title: J Univers. Comput Sci
– volume: 30
  start-page: 492
  issue: 2
  year: 2005
  end-page: 528
  article-title: Making snapshot isolation serializable
  publication-title: ACM Trans Database Syst
– volume: 15
  start-page: 1
  year: 2022
  end-page: 10
– start-page: 21
  year: 2017
  end-page: 35
– volume: 15
  start-page: 3411
  issue: 12
  year: 2022
  end-page: 3424
  article-title: ByteHTAP: ByteDance's HTAP system with high data freshness and strong data consistency
  publication-title: Proc VLDB Endow
– volume: 10
  start-page: 781
  issue: 7
  year: 2017
  end-page: 792
  article-title: An empirical evaluation of in‐memory multi‐version concurrency control
  publication-title: Proc VLDB Endow
– start-page: 1
  year: 1995
  end-page: 10
– volume: 8
  start-page: 209
  issue: 3
  year: 2014
  end-page: 220
  article-title: Staring into the abyss: an evaluation of concurrency control with one thousand cores
  publication-title: Proc VLDB Endow
– volume: 13
  start-page: 3531
  year: 2020
  end-page: 3544
  article-title: An analysis of concurrency control protocols for in‐memory databases with CCBench
  publication-title: Proc VLDB Endow
– start-page: 1307
  year: 2016
  end-page: 1318
– volume: 10
  start-page: 49
  issue: 2
  year: 2016
  end-page: 60
  article-title: Mostly‐optimistic concurrency control for highly contended dynamic workloads on a thousand cores
  publication-title: Proc VLDB Endow
– volume: 34
  issue: 4
  year: 2009
  article-title: Serializable isolation for snapshot databases
  publication-title: ACM Trans Database Syst
– start-page: 280
  year: 2022
  end-page: 287
– start-page: 18
  year: 2013
  end-page: 32
– start-page: 201
  year: 2022
  end-page: 208
– start-page: 1243
  year: 2013
  end-page: 1254
– start-page: 691
  year: 2015
  end-page: 706
– start-page: 1629
  year: 2016
  end-page: 1642
– volume: 5
  start-page: 1850
  issue: 12
  year: 2012
  end-page: 1861
  article-title: Serializable snapshot isolation in PostgreSQL
  publication-title: Proc VLDB Endow
– ident: e_1_2_11_7_1
  doi: 10.1145/2771937.2771949
– ident: e_1_2_11_19_1
– ident: e_1_2_11_23_1
  doi: 10.14778/3067421.3067427
– ident: e_1_2_11_31_1
  doi: 10.1145/1620585.1620587
– ident: e_1_2_11_8_1
  doi: 10.14778/2809974.2809981
– ident: e_1_2_11_11_1
  doi: 10.1145/2723372.2746480
– ident: e_1_2_11_13_1
  doi: 10.1145/2882903.2882935
– ident: e_1_2_11_36_1
  doi: 10.1201/9781315388021
– start-page: 2390
  volume-title: International Conference on BigData (BigData)
  year: 2021
  ident: e_1_2_11_3_1
– start-page: 201
  volume-title: Australasian Database Conference (ADC)
  year: 2022
  ident: e_1_2_11_16_1
– ident: e_1_2_11_2_1
  doi: 10.3897/jucs.2020.006
– ident: e_1_2_11_15_1
  doi: 10.1109/BigComp54360.2022.00060
– ident: e_1_2_11_35_1
  doi: 10.14778/3554821.3554832
– start-page: 677
  volume-title: SIGMOD International Conference on Management of Data
  year: 2015
  ident: e_1_2_11_10_1
– ident: e_1_2_11_18_1
  doi: 10.1145/3448016.3457294
– ident: e_1_2_11_30_1
  doi: 10.1145/1071610.1071615
– ident: e_1_2_11_6_1
  doi: 10.1145/2517349.2522713
– ident: e_1_2_11_25_1
  doi: 10.1145/2463676.2463710
– ident: e_1_2_11_9_1
– ident: e_1_2_11_34_1
– ident: e_1_2_11_12_1
  doi: 10.14778/3015274.3015276
– ident: e_1_2_11_21_1
  doi: 10.1145/3477132.3483591
– ident: e_1_2_11_28_1
– ident: e_1_2_11_4_1
  doi: 10.1109/IROS47612.2022.9981089
– ident: e_1_2_11_20_1
  doi: 10.1145/2213836.2213838
– ident: e_1_2_11_32_1
  doi: 10.14778/2367502.2367523
– ident: e_1_2_11_22_1
  doi: 10.14778/2735508.2735511
– ident: e_1_2_11_29_1
  doi: 10.1145/223784.223785
– volume-title: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery
  year: 2001
  ident: e_1_2_11_5_1
– ident: e_1_2_11_17_1
  doi: 10.2197/ipsjjip.30.552
– ident: e_1_2_11_14_1
  doi: 10.1145/3035918.3064015
– ident: e_1_2_11_33_1
– ident: e_1_2_11_26_1
  doi: 10.1145/2882903.2903734
– ident: e_1_2_11_24_1
  doi: 10.14778/3424573.3424575
– ident: e_1_2_11_27_1
  doi: 10.14778/3364324.3364328
SSID ssj0011031
Score 2.4114091
Snippet Summary This article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC...
This article proposes EPO‐R, which is an efficient garbage collection scheme designed for multi‐version concurrency control (MVCC) protocols. MVCC generates a...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
SubjectTerms Changing environments
Garbage collection
multi‐version concurrency control
transaction processing
Title EPO‐R: An efficient garbage collection scheme for long‐term transactions
URI https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.8134
https://www.proquest.com/docview/3072963566
Volume 36
WOSCitedRecordID wos001214142400001&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: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1532-0634
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0011031
  issn: 1532-0626
  databaseCode: DRFUL
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60evBifWJ9EUH0tLq7SXYbb1JbPJRaxEpvS7KZFEFXsdWzP8Hf6C8x2UeroCB42ssMhHlkvmwm3wAcCuTK1g3jKRZzj0UYeVJx7sWUU6ONkixn57_txr1eczgU_bKr0r2FKfghpj_cXGbk-7VLcKnGpzPS0PQJT5oBZfOwEAS06cY2hKw_vUFw4wsKrtTQ8y1qr4hn_fC00vxeimb48itKzctMp_6fBa7AcgkuyXkRDaswh9ka1KvBDaTM43XotvtXH2_v12fkPCOYk0jY2kNG7u5hhMTFRt6hlRF79sUHJBbZkvvHbGSV3FZOJrMp4-MNGHTaN61Lrxyr4KXUnkE9jrGfKqG1e5MrpCPIibSRzNcYSKkFwziKjVGBRus7HblGKIpBnArBOdeUbkIte8xwC4hQoQhNynVsBDM2lWWELPUZo6hkQGUDjisLJ2nJOe5GX9wnBVtymFgjJc5IDTiYSj4VPBs_yOxWTkrKTBsn1FGfO5K9qAFHuTt-1U9a_bb7bv9VcAeWQothin6_XahNnl9wDxbT18nd-Hk_j7d9WLi47gy6n57e220
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60CnrxLVarRhA9re5ukl2jp1IqirUWqeJtyW4mRdBV2urZn-Bv9JeY7KNVUBA87WUGlnlkviSTbwB2BfLY1A3txCzkDgswcGTMuRNSTrXSsWQZO_9tK2y3j-7uRGcCTsq3MDk_xOjAzWZGtl7bBLcH0odj1tDkGQ-OPMomYYqZImOD3Ged0RWCnV-Qk6X6jmtge8k86_qHpeb3WjQGmF9halZnTuf_9YcLMFfAS1LP42ERJjBdgvlydAMpMnkZWs3O1cfb-_UxqacEMxoJU31Iz94-9JDY6Mh6tFJidr_4iMRgW_LwlPaMkl3MyXA8Z3ywAjenzW7jzCkGKzgJNbtQh2PoJrFQyr7KFdJS5ARKS-Yq9KRUgmEYhFrHnkLjPRXYViiKXpgIwTlXlK5CJX1KcQ2IiH3h64SrUAumTTLLAFniMkYxlh6VVdgvTRwlBeu4HX7xEOV8yX5kjBRZI1VhZyT5nDNt_CBTK70UFbk2iKglP7c0e0EV9jJ__KofNTpN-13_q-A2zJx1L1tR67x9sQGzvkE0efdfDSrD_gtuwnTyOrwf9Ley4PsEzYHduA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60injxLdZnBNHT2t1NstvoSbRFsdQiKt6W7GZSBF1LWz37E_yN_hKTfbQKCoKnvcxAmEfmy2byDcCeQB6buqGdmIXcYQEGjow5d0LKqVY6lixj579rhe12_f5edCbguHwLk_NDjH642czI9mub4NhTujZmDU16eFj3KJuEKWZnyFRg6uy6edsaXSLYCQY5XarvuAa4l9yzrl8rdb9XozHE_ApUs0rTnP_XGhdgrgCY5CSPiEWYwHQJ5svhDaTI5WVoNTpXH2_v10fkJCWYEUmY-kO69v6hi8TGR9allRJz_sUnJAbdksfntGuU7HZOhuNJ44MVuG02bk7PnWK0gpNQcw51OIZuEgul7LtcIS1JTqC0ZK5CT0olGIZBqHXsKTT-U4FthqLohYkQnHNF6SpU0ucU14CI2Be-TrgKtWDapLMMkCUuYxRj6VFZhYPSxFFS8I7b8RePUc6Y7EfGSJE1UhV2R5K9nGvjB5nN0ktRkW2DiFr6c0u0F1RhP_PHr_rRaadhv-t_FdyBmc5ZM2pdtC83YNY3kCZv_9uEyrD_glswnbwOHwb97SL6PgGZyt7O
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=EPO%E2%80%90R%3A+An+efficient+garbage+collection+scheme+for+long%E2%80%90term+transactions&rft.jtitle=Concurrency+and+computation&rft.au=Onishi%2C+Rina&rft.au=Hoshino%2C+Takashi&rft.au=Kawashima%2C+Hideyuki&rft.date=2024-08-01&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=36&rft.issue=17&rft.epage=n%2Fa&rft_id=info:doi/10.1002%2Fcpe.8134&rft.externalDBID=10.1002%252Fcpe.8134&rft.externalDocID=CPE8134
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon