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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information systems (Oxford) Ročník 104; s. 101913
Hlavní autori:	Wu, Gang, Song, Yidong, Zhao, Guodong, Sun, Wei, Han, Donghong, Qiao, Baiyou, Wang, Guoren, Yuan, Ye
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier Ltd 01.02.2022 Elsevier Science Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!