Cracking in-memory database index: A case study for Adaptive Radix Tree index
作者:
Highlights:
• In-memory database indexes have more extensive research and application space.
• Database Cracking is used as a method applied to in-memory database indexes.
• The algorithm has better performance advantages under random queries.
摘要
•In-memory database indexes have more extensive research and application space.•Database Cracking is used as a method applied to in-memory database indexes.•The algorithm has better performance advantages under random queries.
论文关键词:Database cracking,ART,In-memory database
论文评审过程:Received 20 February 2020, Revised 2 February 2021, Accepted 7 October 2021, Available online 16 October 2021, Version of Record 29 October 2021.
论文官网地址:https://doi.org/10.1016/j.is.2021.101913