Cracking in-memory database index: A case study for Adaptive Radix Tree index

Indexes provide a method to access data in databases quickly. It can improve the response speed of subsequent queries by building a complete index in advance. However, it also leads to a huge overhead of the continuous updating during creating the index. An in-memory database usually has a higher qu...

Full description

Saved in:

Bibliographic Details
Published in:	Information systems (Oxford) Vol. 104; p. 101913
Main Authors:	Wu, Gang, Song, Yidong, Zhao, Guodong, Sun, Wei, Han, Donghong, Qiao, Baiyou, Wang, Guoren, Yuan, Ye
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier Ltd 01.02.2022 Elsevier Science Ltd
Subjects:	Algorithms Antiretroviral therapy Case studies Columnar structure Data structures Database cracking Experiments Feasibility In-memory database Indexes Information systems Memory Performance indices Queries Query processing Reaction time Response time (computers) Time Database cracking ART In-memory database
ISSN:	0306-4379, 1873-6076
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!