AKV: Agile Read-Efficiently Key-Value OLTP Engine for Non-Volatile Memory

Non-volatile memory (NVM), as an emergingstor age technology, offers several advantageous features for OLTP engines, including byte-addressability, high capacity, low energy consumption, and data persistence across power failures. Despite these benefits, the current mainstream OLTP engines still com...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering pp. 1 - 14
Main Authors: Liu, Shuai, Qin, Jianbin, Wang, Tianyu, Chen, Yuxing, Pan, Anqun, Mao, Rui, Qiu, Yuxuan, Onizuka, Makoto, Xiao, Chuan
Format: Journal Article
Language:English
Published: IEEE 2025
Subjects:
Aerospace electronics
Concurrency control
Costs
Energy consumption
Engines
Indexes
Non-volatile memory
Nonvolatile memory
OLTP storage engine
Random access memory
Systems architecture
Throughput
transaction
ISSN:1041-4347, 1558-2191
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Non-volatile memory (NVM), as an emergingstor age technology, offers several advantageous features for OLTP engines, including byte-addressability, high capacity, low energy consumption, and data persistence across power failures. Despite these benefits, the current mainstream OLTP engines still commonly adopt a hybrid architecture that deeply couples DRAM with NVM, which results in a complex system architecture and high recovery costs. In this paper, we aim to construct a highly available, stable, and recoverable OLTP engine that guarantees ACID properties through anagile system architecture. We introduce AKV (Agile Key-Value), an NVM-only OLTP storage engine designed to provide effective space utilization, high throughput, and fast failure recovery. AKV addresses the challenges of NVM space management, write redundancy, and concurrency control with two novel techniques: dual-version concurrency control and circular dual-version storage. Experimental results demonstrate that AKV achieves higher throughput (up to 69.7%) and faster recovery (up to 54×) compared to existing storage engines in most scenarios of the TPC-C benchmarks. Additionally, the codebase of AKV (4k+ lines) is more concise than that of SOTA OLTP engines like Zen (8k+ lines) and Falcon (11k+ lines). In addition, this study innovatively proposes a read abort optimization strategy based on dynamic version changes. The experimental results show that this strategy can significantly reduce the transaction abort rate of AKV in specific workload scenarios while maintaining stable system throughput, achieving a maximum reduction of up to 73% in the abort count.
AbstractList Non-volatile memory (NVM), as an emergingstor age technology, offers several advantageous features for OLTP engines, including byte-addressability, high capacity, low energy consumption, and data persistence across power failures. Despite these benefits, the current mainstream OLTP engines still commonly adopt a hybrid architecture that deeply couples DRAM with NVM, which results in a complex system architecture and high recovery costs. In this paper, we aim to construct a highly available, stable, and recoverable OLTP engine that guarantees ACID properties through anagile system architecture. We introduce AKV (Agile Key-Value), an NVM-only OLTP storage engine designed to provide effective space utilization, high throughput, and fast failure recovery. AKV addresses the challenges of NVM space management, write redundancy, and concurrency control with two novel techniques: dual-version concurrency control and circular dual-version storage. Experimental results demonstrate that AKV achieves higher throughput (up to 69.7%) and faster recovery (up to 54×) compared to existing storage engines in most scenarios of the TPC-C benchmarks. Additionally, the codebase of AKV (4k+ lines) is more concise than that of SOTA OLTP engines like Zen (8k+ lines) and Falcon (11k+ lines). In addition, this study innovatively proposes a read abort optimization strategy based on dynamic version changes. The experimental results show that this strategy can significantly reduce the transaction abort rate of AKV in specific workload scenarios while maintaining stable system throughput, achieving a maximum reduction of up to 73% in the abort count.
Author Wang, Tianyu
Qiu, Yuxuan
Xiao, Chuan
Chen, Yuxing
Liu, Shuai
Onizuka, Makoto
Pan, Anqun
Mao, Rui
Qin, Jianbin
Author_xml – sequence: 1
  givenname: Shuai
  surname: Liu
  fullname: Liu, Shuai
  email: liushuai2022@email.szu.edu.cn
  organization: Shenzhen University, Shenzhen, China
– sequence: 2
  givenname: Jianbin
  surname: Qin
  fullname: Qin, Jianbin
  email: qinjianbin@szu.edu.cn
  organization: Shenzhen University, Shenzhen, China
– sequence: 3
  givenname: Tianyu
  surname: Wang
  fullname: Wang, Tianyu
  email: tywang@szu.edu.cn
  organization: Shenzhen University, Shenzhen, China
– sequence: 4
  givenname: Yuxing
  surname: Chen
  fullname: Chen, Yuxing
  email: axingguchen@tencent.com
  organization: Tencent Inc., Shenzhen, China
– sequence: 5
  givenname: Anqun
  surname: Pan
  fullname: Pan, Anqun
  email: aaronpan@tencent.com
  organization: Tencent Inc., Shenzhen, China
– sequence: 6
  givenname: Rui
  surname: Mao
  fullname: Mao, Rui
  email: mao@szu.edu.cn
  organization: Shenzhen University, Shenzhen, China
– sequence: 7
  givenname: Yuxuan
  surname: Qiu
  fullname: Qiu, Yuxuan
  email: qiuyx.cs@gmail.com
  organization: Beijing Institute of Technology, Zhuhai, China
– sequence: 8
  givenname: Makoto
  surname: Onizuka
  fullname: Onizuka, Makoto
  email: onizuka@ist.osaka-u.ac.jp
  organization: Osaka University, Osaka, Japan
– sequence: 9
  givenname: Chuan
  surname: Xiao
  fullname: Xiao, Chuan
  email: chuanx@ist.osaka-u.ac.jp
  organization: Osaka University, Osaka, Japan
BookMark eNpFkM1Kw0AUhQepYFt9AMHFvMDUufPTTNyVmmpJtCKx2zBJ7pRImsikLvL2JrTg6h4u5zuLb0YmTdsgIffAFwA8fEzj52ghuNALuZRChPqKTEFrwwSEMBkyV8CUVMENmXXdN-fcBAamZLuK9090dahqpJ9oSxY5VxUVNqe6pzH2bG_rX6S7JP2gUXOoGqSu9fS9bdi-re1p5N7w2Pr-llw7W3d4d7lz8rWJ0vUrS3Yv2_UqYQVIfWJF7kA6nodBKZaF0UtuOLjCgbFSKAs5oMag1OiUFiHPdTn8VDlkY3RpQM4JnHcL33adR5f9-OpofZ8Bz0YX2egiG11kFxcD83BmKkT874NQSoCRf-LKWvs
CODEN ITKEEH
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TKDE.2025.3632295
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1558-2191
EndPage 14
ExternalDocumentID 10_1109_TKDE_2025_3632295
11244218
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
IEDLZ
IFIPE
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
RXW
TAE
TN5
UHB
1OL
5VS
9M8
AAYXX
ABFSI
AETIX
AGSQL
AI.
AIBXA
ALLEH
CITATION
E.L
H~9
ICLAB
IFJZH
RNI
RZB
TAF
VH1
ID FETCH-LOGICAL-c135t-cbf13f0b97d26c8560801fcf18a324a1b1e5e7d5ef45290b5da1b4d529885d813
IEDL.DBID RIE
ISSN 1041-4347
IngestDate Sat Nov 29 06:49:20 EST 2025
Wed Nov 19 08:26:45 EST 2025
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c135t-cbf13f0b97d26c8560801fcf18a324a1b1e5e7d5ef45290b5da1b4d529885d813
PageCount 14
ParticipantIDs crossref_primary_10_1109_TKDE_2025_3632295
ieee_primary_11244218
PublicationCentury 2000
PublicationDate 2025-00-00
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 2025-00-00
PublicationDecade 2020
PublicationTitle IEEE transactions on knowledge and data engineering
PublicationTitleAbbrev TKDE
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0008781
Score 2.4521933
Snippet Non-volatile memory (NVM), as an emergingstor age technology, offers several advantageous features for OLTP engines, including byte-addressability, high...
SourceID crossref
ieee
SourceType Index Database
Publisher
StartPage 1
SubjectTerms Aerospace electronics
Concurrency control
Costs
Energy consumption
Engines
Indexes
Non-volatile memory
Nonvolatile memory
OLTP storage engine
Random access memory
Systems architecture
Throughput
transaction
Title AKV: Agile Read-Efficiently Key-Value OLTP Engine for Non-Volatile Memory
URI https://ieeexplore.ieee.org/document/11244218
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2191
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008781
  issn: 1041-4347
  databaseCode: RIE
  dateStart: 19890101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG6EeNCDKGLEX-nBk8lga9eu80YUogGRAy7clq1rjQnZDIIJ_72v3VA8ePDWNHvL8t7a972-r-8hdB1QRVJhmK2KCcenGtYcwG5HEyK4JGmYWLZ7NArGYzGbhZPqsrq9C6OUsuQz1TFDm8vPCrkyR2Vdzzgj8Ek1VAsCXl7W-t52RWA7kkJ4AUER9YMqhem5YXc6vO9DKEhYh3Jq-lf_ckJbXVWsUxk0_vk5h-igQo-4V5r7CO2ovIkam84MuFqoTbS_VWbwGD32htEt7r3CBoANad7p27oR8PL5Gg_V2omS-Urh59F0gktBDFAWj4vciQrDlQO5J8PIXbfQy6A_vXtwqhYKjvQoWzoy1R7VbhoGGeFSALwBj6Sl9kQCSCrxUk8xFWRMaZOAdVOWwZyfwVgIlgmPnqB6XuTqFOEkBd0BwMs4SX3OpFCuTAAwcU1CnXDSRjcbncbvZaWM2EYYbhgbA8TGAHFlgDZqGX3-PFip8uyP-XO0Z8TLs48LVF8uVuoS7crP5dvH4sr-CF-dVa2J
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9RNFEPoogRP3vwZDLcOrp13ohCIHzIAQm3ZetaY0I2g2DCf-9rNxQPHry9NGuzvNf2_V7fF8Ct70oacx3ZKhm3Gq7CM4ew21KUck_QOIhMtPuk7w-HfDoNRkWyusmFkVKa4DNZ16Tx5SeZWOqnsntHKyPUSduww5Cw83St74uX-6YnKRoYaBa5Db9wYjp2cD_uPbXQGKSs7nqu7mD9Sw1t9FUxaqVd_ucPHcFhgR9JMxf4MWzJtALldW8GUhzVChxsFBo8gW6zN3kgzVe8AogOm7dapnIELj5bkZ5cWZNotpTkuT8ekXwiQTBLhllqTTIdLYfzBjomd1WFl3Zr_NixiiYKlnBctrBErBxX2XHgJ9QTHAEO6iQllMMjxFKREzuSST9hUmkXrB2zBMcaCdKcs4Q77imU0iyVZ0CiGHmHEC_xaNzwmODSFhFCJk_RQEUercHdmqfhe14rIzQ2hh2EWgChFkBYCKAGVc3Pnw8LVp7_MX4De53xoB_2u8PeBezrpfKXkEsoLeZLeQW74nPx9jG_NpviC9a3sNA
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=AKV%3A+Agile+Read-Efficiently+Key-Value+OLTP+Engine+for+Non-Volatile+Memory&rft.jtitle=IEEE+transactions+on+knowledge+and+data+engineering&rft.au=Liu%2C+Shuai&rft.au=Qin%2C+Jianbin&rft.au=Wang%2C+Tianyu&rft.au=Chen%2C+Yuxing&rft.date=2025&rft.issn=1041-4347&rft.eissn=1558-2191&rft.spage=1&rft.epage=14&rft_id=info:doi/10.1109%2FTKDE.2025.3632295&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TKDE_2025_3632295
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1041-4347&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1041-4347&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1041-4347&client=summon