Processing of multidimensional range query using SIMD instructions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86080861" target="_blank" >RIV/61989100:27240/11:86080861 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-642-25483-3_18" target="_blank" >http://dx.doi.org/10.1007/978-3-642-25483-3_18</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-25483-3_18" target="_blank" >10.1007/978-3-642-25483-3_18</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Processing of multidimensional range query using SIMD instructions

Popis výsledku v původním jazyce

Current main stream CPUs provide SIMD (Single Instruction Multiple Data) computational capabilities. Although producers of current hardware provide other computational capabilities like multicores CPU, GPU or APU, an important feature of SIMD is that itprovides parallel operations for one CPU's core. In previous works, authors introduced an utilization of the SIMD instructions in some indexing data structures like B-tree. Since multidimensional data structures manage n-dimensional tuples or rectangles,the utilization of these instructions seems to be straightforward in operations manipulating these n-dimensional objects. In this article, we show the utilization of SIMD in the R-tree data structure. Since the range query is one of the most important operation of multidimensional data structures, we suppose the utilization of SIMD in range query processing. Moreover, we show properties and scalability of this solution. We show that the SIMD range query algorithm is up-to 2x faster then

Název v anglickém jazyce

Processing of multidimensional range query using SIMD instructions

Popis výsledku anglicky

Current main stream CPUs provide SIMD (Single Instruction Multiple Data) computational capabilities. Although producers of current hardware provide other computational capabilities like multicores CPU, GPU or APU, an important feature of SIMD is that itprovides parallel operations for one CPU's core. In previous works, authors introduced an utilization of the SIMD instructions in some indexing data structures like B-tree. Since multidimensional data structures manage n-dimensional tuples or rectangles,the utilization of these instructions seems to be straightforward in operations manipulating these n-dimensional objects. In this article, we show the utilization of SIMD in the R-tree data structure. Since the range query is one of the most important operation of multidimensional data structures, we suppose the utilization of SIMD in range query processing. Moreover, we show properties and scalability of this solution. We show that the SIMD range query algorithm is up-to 2x faster then

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/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Zpracování XML dat v heterogenních a dynamických prostředích</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2011

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

Communications in Computer and Information Science

ISSN

1865-0929

e-ISSN

—

Svazek periodika

2011

Číslo periodika v rámci svazku

254

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

15

Strana od-do

223-237

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—