B-tree
A self-balancing tree data structure used for database indexing; allows efficient searching through sorted data with logarithmic time complexity, but does not parallelize well
As defined in Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
Where it comes up · 1
Most important claims · 1 of 1Search all claims for “B-tree” →
- GPUs are poorly suited for database operations requiring indexing because indexing does not parallelize well—searching a B-tree requires sequential pointer-following (3-4 memory accesses) that cannot be executed in parallel, whereas GPUs are optimized for SIMD (single instruction multi-data) workloads.Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker