Sciweavers

Share
4 search results - page 1 / 1
» FAST: fast architecture sensitive tree search on modern CPUs...
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
10 years 8 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
CG
2008
Springer
11 years 1 months ago
Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
Ingo Wald, Thiago Ize, Steven G. Parker
TOG
2008
145views more  TOG 2008»
11 years 1 months ago
Real-time KD-tree construction on graphics hardware
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
Kun Zhou, Qiming Hou, Rui Wang 0004, Baining Guo
VLDB
1999
ACM
151views Database» more  VLDB 1999»
11 years 5 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
books