Name
Abstract | ||
|---|---|---|
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 paper, we present FAST, an extremely fast architecture sensitive layout of the index tree. FAST is a binary tree logically organized to optimize for architecture features like page size, cache line size, and SIMD width of the underlying hardware. FAST eliminates impact of memory latency, and exploits thread-level and datalevel parallelism on both CPUs and GPUs to achieve 50 million (CPU) and 85 million (GPU) queries per second, 5X (CPU) and 1.7X (GPU) faster than the best previously reported performance on the same architectures. FAST supports efficient bulk updates by rebuilding index trees in less than 0.1 seconds for datasets as large as 64Mkeys and naturally integrates compression techniques, overcoming the memory bandwidth bottleneck and achieving a 6X performance improvement over uncompressed index search for large keys on CPUs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1807167.1807206 | SIGMOD Conference |
Keywords | Field | DocType |
in-memory tree,binary tree,cache line size,tree search,sensitive tree search,modern cpus,index tree,uncompressed index search,architecture feature,index search,tree traversal,fast architecture,database primitive,data level parallelism,memory bandwidth,cpu,indexation,thread level parallelism,memory latency,processor architecture,tree structure,compression,data access | Memory bandwidth,Tree traversal,Task parallelism,CPU cache,Computer science,Parallel computing,Binary tree,SIMD,Data parallelism,Fractal tree index | Conference |
Citations | PageRank | References |
146 | 5.47 | 28 |
Authors | ||
9 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Changkyu Kim | 1 | 1848 | 98.89 |
| Jatin Chhugani | 2 | 1452 | 79.32 |
| Nadathur Satish | 3 | 2020 | 99.88 |
| Eric Sedlar | 4 | 334 | 15.57 |
| Anthony D. Nguyen | 5 | 1080 | 55.39 |
| Tim Kaldewey | 6 | 398 | 17.18 |
| Victor W. Lee | 7 | 965 | 53.75 |
| Scott A. Brandt | 8 | 1663 | 94.81 |
| Pradeep K. Dubey | 9 | 3432 | 292.69 |