{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:13:33Z","timestamp":1783613613123,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T00:00:00Z","timestamp":1742256000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T00:00:00Z","timestamp":1742256000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572194"],"award-info":[{"award-number":["61572194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572194"],"award-info":[{"award-number":["61572194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572194"],"award-info":[{"award-number":["61572194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572194"],"award-info":[{"award-number":["61572194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07034-y","type":"journal-article","created":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T15:17:30Z","timestamp":1742311050000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A B\u03b5-organized table using Markov decision process for main memory database engines"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7919-7162","authenticated-orcid":false,"given":"Qian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7532-7153","authenticated-orcid":false,"given":"Xueqing","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junxian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"7034_CR1","doi-asserted-by":"crossref","unstructured":"Hsieh K, Khan S, Vijaykumar N, Chang KK, Boroumand A, Ghose S, Mutlu O (2016) Accelerating pointer chasing in 3d-stacked memory: challenges, mechanisms, evaluation. In: 2016 IEEE 34th International Conference on Computer Design (ICCD), IEEE, pp 25\u201332","DOI":"10.1109\/ICCD.2016.7753257"},{"key":"7034_CR2","doi-asserted-by":"crossref","unstructured":"Li S, Chen Z, Xiao N, Sun G (2018) Path prefetching: Accelerating index searches for in-memory databases. In: 2018 IEEE 36th International Conference on Computer Design (ICCD), IEEE, pp 274\u2013277","DOI":"10.1109\/ICCD.2018.00049"},{"issue":"3","key":"7034_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.14778\/3632093.3632117","volume":"17","author":"K Huang","year":"2023","unstructured":"Huang K, Wang T, Zhou Q, Meng Q (2023) The art of latency hiding in modern database engines. Proceed VLDB Endow 17(3):577\u2013590","journal-title":"Proceed VLDB Endow"},{"key":"7034_CR4","doi-asserted-by":"crossref","unstructured":"Mao Y, Kohler E, Morris RT (2012) Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th ACM European Conference on Computer Systems, pp 183\u2013196","DOI":"10.1145\/2168836.2168855"},{"key":"7034_CR5","doi-asserted-by":"crossref","unstructured":"Weisz G, Melber J, Wang Y, Fleming K, Nurvitadhi E, Hoe JC (2016) A study of pointer-chasing performance on shared-memory processor-fpga systems. In: Proceedings of the 2016 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp 264\u2013273","DOI":"10.1145\/2847263.2847269"},{"key":"7034_CR6","doi-asserted-by":"crossref","unstructured":"Wang Z, Pavlo A, Lim H, Leis V, Zhang H, Kaminsky M, Andersen DG (2018) Building a bw-tree takes more than just buzz words. In: Proceedings of the 2018 International Conference on Management of Data, pp 473\u2013488","DOI":"10.1145\/3183713.3196895"},{"key":"7034_CR7","unstructured":"Index CGC (2018) Forecast and methodology, 2016\u20132021 white paper. Updated: February 1"},{"key":"7034_CR8","doi-asserted-by":"crossref","unstructured":"Lim H, Kaminsky M, Andersen DG (2017) Cicada: Dependably fast multi-core in-memory transactions. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp 21\u201335","DOI":"10.1145\/3035918.3064015"},{"issue":"2","key":"7034_CR9","doi-asserted-by":"publisher","first-page":"128","DOI":"10.14778\/3364324.3364328","volume":"13","author":"J B\u00f6ttcher","year":"2019","unstructured":"B\u00f6ttcher J, Leis V, Neumann T, Kemper A (2019) Scalable garbage collection for in-memory mvcc systems. Proceed VLDB Endow 13(2):128\u2013141","journal-title":"Proceed VLDB Endow"},{"key":"7034_CR10","doi-asserted-by":"crossref","unstructured":"Doki K, Hoshino T, Kawashima H (2023) Accelerating scan transaction with node locking. In: 2023 IEEE 29th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), IEEE, pp 101\u2013106","DOI":"10.1109\/RTCSA58653.2023.00021"},{"key":"7034_CR11","unstructured":"Li A (2023) Bp-tree: Overcoming the point-range operation tradeoff for in-memory b+-trees. PhD thesis, Massachusetts Institute of Technology"},{"key":"7034_CR12","doi-asserted-by":"crossref","unstructured":"Kim J, Kim K, Cho H, Yu J, Kang S, Jung H (2021) Rethink the scan in mvcc databases. In: Proceedings of the 2021 International Conference on Management of Data, pp 938\u2013950","DOI":"10.1145\/3448016.3452783"},{"key":"7034_CR13","doi-asserted-by":"crossref","unstructured":"Boroumand A, Ghose S, Oliveira GF, Mutlu O (2021) Polynesia: enabling effective hybrid transactional\/analytical databases with specialized hardware\/software co-design. arXiv preprint arXiv:2103.00798","DOI":"10.1109\/ICDE53745.2022.00270"},{"key":"7034_CR14","doi-asserted-by":"crossref","unstructured":"Kang H, Zhao Y, Blelloch GE, Dhulipala L, Gu Y, McGuffey C, Gibbons PB (2023) Pim-tree: a skew-resistant index for processing-in-memory. In: Proceedings of the 2023 ACM workshop on highlights of parallel computing, pp 13\u201314","DOI":"10.1145\/3597635.3598029"},{"key":"7034_CR15","first-page":"100022","volume":"4","author":"K Asifuzzaman","year":"2022","unstructured":"Asifuzzaman K, Miniskar NR, Young AR, Liu F, Vetter JS (2022) A survey on processing-in-memory techniques: advances and challenges. Mem Mater Devices Circuits Syst 4:100022","journal-title":"Mem Mater Devices Circuits Syst"},{"key":"7034_CR16","doi-asserted-by":"crossref","unstructured":"Young V, Chishti ZA, Qureshi MK (2019) Tictoc: enabling bandwidth-efficient dram caching for both hits and misses in hybrid memory systems. In: 2019 IEEE 37th International Conference on Computer Design (ICCD), IEEE, pp 341\u2013349","DOI":"10.1109\/ICCD46524.2019.00055"},{"issue":"1","key":"7034_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588699","volume":"1","author":"A Raza","year":"2023","unstructured":"Raza A, Chrysogelos P, Anadiotis AC, Ailamaki A (2023) One-shot garbage collection for in-memory oltp through temporality-aware version storage. Proceed ACM Manag Data 1(1):1\u201325","journal-title":"Proceed ACM Manag Data"},{"key":"7034_CR18","doi-asserted-by":"crossref","unstructured":"Zhang H, Andersen DG, Pavlo A, Kaminsky M, Ma L, Shen R (2016) Reducing the storage overhead of main-memory oltp databases with hybrid indexes. In: Proceedings of the 2016 international Conference on Management of Data, pp 1567\u20131581","DOI":"10.1145\/2882903.2915222"},{"issue":"4","key":"7034_CR19","doi-asserted-by":"publisher","first-page":"574","DOI":"10.14778\/3372716.3372728","volume":"13","author":"L Lersch","year":"2019","unstructured":"Lersch L, Hao X, Oukid I, Wang T, Willhalm T (2019) Evaluating persistent memory range indexes. Proceed VLDB Endow 13(4):574\u2013587","journal-title":"Proceed VLDB Endow"},{"key":"7034_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2024.103140c","author":"S Mishra","year":"2024","unstructured":"Mishra S, Gohil BN, Ray S (2024) A survey on persistent memory indexes: recent advances, challenges and opportunities. J Syst Arch. https:\/\/doi.org\/10.1016\/j.sysarc.2024.103140c","journal-title":"J Syst Arch"},{"issue":"2","key":"7034_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/12.752654","volume":"48","author":"C-K Luk","year":"1999","unstructured":"Luk C-K, Mowry TC (1999) Automatic compiler-inserted prefetching for pointer-based applications. IEEE Trans Comput 48(2):134\u2013141","journal-title":"IEEE Trans Comput"},{"key":"7034_CR22","unstructured":"Oracle: MySQL: The World\u2019s Most Popular Open Source Database. Oracle. http:\/\/www.mysql.com\/"},{"key":"7034_CR23","unstructured":"Srinivasan J, Das S, Freiwald C, Chong EI, Jagannath M, Yalamanchi A, Krishnan R, Tran AT, DeFazio S, Banerjee J (2000) Oracle8i index-organized table and its application to new domains. In: VLDB, pp 285\u2013296"},{"key":"7034_CR24","doi-asserted-by":"crossref","unstructured":"Yu X, Bezerra G, Pavlo A, Devadas S, Stonebraker M (2014) Staring into the abyss: an evaluation of concurrency control with one thousand cores","DOI":"10.14778\/2735508.2735511"},{"key":"7034_CR25","unstructured":"Brodal GS, Fagerberg R (2003) Lower bounds for external memory dictionaries. SODA 3:546\u2013554"},{"key":"7034_CR26","unstructured":"Jannen W, Yuan J, Zhan Y, Akshintala A, Esmet J, Jiao Y, Mittal A, Pandey P, Reddy P, Walsh L (2015) $$\\{$$BetrFS$$\\}$$: A $$\\{$$Right-Optimized$$\\}$$$$\\{$$Write-Optimized$$\\}$$ file system. In: 13th USENIX conference on file and storage technologies (FAST 15), pp 301\u2013315"},{"key":"7034_CR27","doi-asserted-by":"crossref","unstructured":"Bender MA, Conway A, Farach-Colton M, Jannen W, Jiao Y, Johnson R, Knorr E, McAllister S, Mukherjee N, Pandey P (2019) Small refinements to the dam can have big consequences for data-structure design. In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pp 265\u2013274","DOI":"10.1145\/3323165.3323210"},{"key":"7034_CR28","unstructured":"Zheng W, Tu S, Kohler E, Liskov B (2014) Fast databases with fast durability and recovery through multicore parallelism. In: 11th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 14), pp. 465\u2013477"},{"key":"7034_CR29","doi-asserted-by":"crossref","unstructured":"Diaconu C, Freedman C, Ismert E, Larson P-A, Mittal P, Stonecipher R, Verma N, Zwilling M (2013) Hekaton: Sql server\u2019s memory-optimized oltp engine. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 1243\u20131254","DOI":"10.1145\/2463676.2463710"},{"issue":"7","key":"7034_CR30","doi-asserted-by":"publisher","first-page":"781","DOI":"10.14778\/3067421.3067427","volume":"10","author":"Y Wu","year":"2017","unstructured":"Wu Y, Arulraj J, Lin J, Xian R, Pavlo A (2017) An empirical evaluation of in-memory multi-version concurrency control. Proceed VLDB Endow 10(7):781\u2013792","journal-title":"Proceed VLDB Endow"},{"key":"7034_CR31","doi-asserted-by":"crossref","unstructured":"Kimura H (2015) Foedus: Oltp engine for a thousand cores and nvram. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 691\u2013706","DOI":"10.1145\/2723372.2746480"},{"key":"7034_CR32","doi-asserted-by":"crossref","unstructured":"Ben-Moshe S, Kanza Y, Fischer E, Matsliah A, Fischer M, Staelin, C (2011) Detecting and exploiting near-sortedness for efficient relational query evaluation. In: Proceedings of the 14th International Conference on Database Theory, pp 256\u2013267","DOI":"10.1145\/1938551.1938584"},{"key":"7034_CR33","doi-asserted-by":"crossref","unstructured":"Raman A, Sarkar S, Olma M, Athanassoulis M (2023) Indexing for near-sorted data. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE)","DOI":"10.1109\/ICDE55515.2023.00117"},{"key":"7034_CR34","unstructured":"Kingma DP, Ba, J (2014) Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"key":"7034_CR35","doi-asserted-by":"crossref","unstructured":"Cooper BF, Silberstein A, Tam E, Ramakrishnan R, Sears R (2010) Benchmarking cloud serving systems with ycsb. In: Proceedings of the 1st ACM Symposium on Cloud Computing, pp 143\u2013154","DOI":"10.1145\/1807128.1807152"},{"key":"7034_CR36","unstructured":"TPC BENCHMARK C Standard Specification: TPC: Transaction processing performance council. TPC BENCHMARK C Standard Specification. http:\/\/www.tpc.org\/"},{"key":"7034_CR37","unstructured":"DBx1000: a Single Node OLTP database management system. https:\/\/github.com\/yxymit\/DBx1000"},{"issue":"2","key":"7034_CR38","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/319566.319567","volume":"6","author":"H-T Kung","year":"1981","unstructured":"Kung H-T, Robinson JT (1981) On optimistic methods for concurrency control. ACM Trans Database Syst (TODS) 6(2):213\u2013226","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"7034_CR39","unstructured":"Alhomssi A, Leis V (2021) Contention and space management in b-trees. In: CIDR"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07034-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07034-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07034-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T15:17:43Z","timestamp":1742311063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07034-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,18]]},"references-count":39,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["7034"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07034-y","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,18]]},"assertion":[{"value":"6 February 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"635"}}