A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
2011
ACM Transactions on Database Systems
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. In this article, we present FAST,
doi:10.1145/2043652.2043655
fatcat:aznq3gvf45g75goaxjno2bnj5u