53 search results - page 2 / 11 » Relational joins on graphics processors |
COMAD
1994
13 years 6 months ago
1994
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
GVD
2003
13 years 6 months ago
2003
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
SSD
1999
Springer
13 years 9 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
INTENSIVE
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G8...