Benchmarking a B-tree compression method

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A86085180" target="_blank" >RIV/61989100:27240/09:86085180 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Benchmarking a B-tree compression method

Popis výsledku v původním jazyce

The B-tree and its variants have been widely applied in many data management ?elds. When a compression of these data structures is considered, we follow two objectives. The ?rst objective is a smaller index ?le, the second one is a reduction of the queryprocessing time. In this paper, we apply a compression scheme to ?t these objectives. The utilized compression scheme handles compressed nodes in a secondary storage. If a page must be retrieved then this page is decompressed into the tree cache. Sincethis compression scheme is transparent from the tree operation?s point of view, we can apply various compression algorithms to pages of a tree. Obviously, there are compression algorithms suitable for various data collections, and so, this issue is veryimportant. In our paper, we compare the B-tree and compressed B-tree where the Fast Fibonacci and invariable coding compression methods are applied.

Název v anglickém jazyce

Benchmarking a B-tree compression method

Popis výsledku anglicky

The B-tree and its variants have been widely applied in many data management ?elds. When a compression of these data structures is considered, we follow two objectives. The ?rst objective is a smaller index ?le, the second one is a reduction of the queryprocessing time. In this paper, we apply a compression scheme to ?t these objectives. The utilized compression scheme handles compressed nodes in a secondary storage. If a page must be retrieved then this page is decompressed into the tree cache. Sincethis compression scheme is transparent from the tree operation?s point of view, we can apply various compression algorithms to pages of a tree. Obviously, there are compression algorithms suitable for various data collections, and so, this issue is veryimportant. In our paper, we compare the B-tree and compressed B-tree where the Fast Fibonacci and invariable coding compression methods are applied.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: Zpracování XML dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

CEUR Workshop Proceedings. Volume 584

ISSN

1613-0073

e-ISSN

—

Svazek periodika

584

Číslo periodika v rámci svazku

2009

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

7

Strana od-do

37-43

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—