Cracking In-Memory Database Index A Case Study for Adaptive Radix Tree Index

11/26/2019
by   Gang Wu, et al.
0

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 query processing performance than disk databases and is more suitable for real-time query processing. Therefore, there is an urgent need to reduce the index creation and update cost for in-memory databases. Database cracking technology is currently recognized as an effective method to reduce the index initialization time. However, conventional cracking algorithms are focused on simple column data structure rather than those complex index structure for in-memory databases. In order to show the feasibility of in-memory database index cracking and promote to future more extensive research, this paper conducted a case study on the Adaptive Radix Tree (ART), a popular tree index structure of in-memory databases. On the basis of carefully examining the ART index construction overhead, an algorithm using auxiliary data structures to crack the ART index is proposed.

READ FULL TEXT

page 2

page 3

page 4

page 5

page 6

page 7

page 9

page 11

research
03/27/2019

Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations (Extended Version)

Database administrators construct secondary indexes on data tables to ac...
research
01/30/2018

A-Tree: A Bounded Approximate Index Structure

Index structures are one of the most important tools that DBAs leverage ...
research
04/04/2022

Adaptive Merging on Phase Change Memory

Indexing is a well-known database technique used to facilitate data acce...
research
07/25/2020

Automated Database Indexing using Model-free Reinforcement Learning

Configuring databases for efficient querying is a complex task, often ca...
research
03/20/2019

Indexes in Microsoft SQL Server

Indexes are the best apposite choice for quickly retrieving the records....
research
03/03/2021

Long Live The Image: Container-Native Data Persistence in Production

Containerization plays a crucial role in the de facto technology stack f...
research
06/05/2023

A Simple Yet High-Performing On-disk Learned Index: Can We Have Our Cake and Eat it Too?

While in-memory learned indexes have shown promising performance as comp...

Please sign up or login with your details

Forgot password? Click here to reset