Processing of Range Query Using SIMD and GPU

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86089446" target="_blank" >RIV/61989100:27240/13:86089446 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-32518-2_2" target="_blank" >http://dx.doi.org/10.1007/978-3-642-32518-2_2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-32518-2_2" target="_blank" >10.1007/978-3-642-32518-2_2</a>

Result language
angličtina
Original language name
Processing of Range Query Using SIMD and GPU
Original language description
Onedimensional or multidimensional range query is one of the most important query of physical implementation of DBMS. The number of compared items (of a data structure) can be enormous especially for lower selectivity of the range query. The number of compare operations increases for more complex items (or tuples) with the longer length, e.g. words stored in a B-tree. Due to the possibly high number of compare operations executed during the range query processing, we can take into account hardware devices providing a parallel task computation like CPU's SIMD or GPU. In this paper, we show the performance and scalability of sequential, index, CPU's SIMD, and GPU variants of the range query algorithm. These results make possible a future integration of these computation devices into a DBMS kernel.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Handling XML Data in Heterogeneous and Dynamic Environments</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)