1493

FAST: fast architecture sensitive tree search on modern CPUs and GPUs

Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eric Sedlar, Anthony D. Nguyen, Tim Kaldewey, Victor W. Lee, Scott A. Brandt, Pradeep Dubey
Intel Corporation, Santa Clara, CA, USA
In SIGMOD ’10: Proceedings of the 2010 international conference on Management of data (2010), pp. 339-350.

@conference{kim2010fast,

   title={FAST: fast architecture sensitive tree search on modern CPUs and GPUs},

   author={Kim, C. and Chhugani, J. and Satish, N. and Sedlar, E. and Nguyen, A.D. and Kaldewey, T. and Lee, V.W. and Brandt, S.A. and Dubey, P.},

   booktitle={Proceedings of the 2010 international conference on Management of data},

   pages={339–350},

   year={2010},

   organization={ACM}

}

Download Download (PDF)   View View   Source Source   

796

views

In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vector units. There has been much work to exploit modern processor architectures for database primitives like scan, sort, join and aggregation. However, unlike other primitives, tree search presents significant challenges due to irregular and unpredictable data accesses in tree traversal.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: