Performance of Point and Range Queries for In-memory Databases using Radix Trees on GPUs

Conference · Fri Jan 01 00:00:00 EST 2016

OSTI ID:1338492

Alam, Maksudul ^[1]; Yoginath, Srikanth B ^[1]; Perumalla, Kalyan S ^[1]

---

1. ORNL

In in-memory database systems augmented by hardware accelerators, accelerating the index searching operations can greatly increase the runtime performance of database queries. Recently, adaptive radix trees (ART) have been shown to provide very fast index search implementation on the CPU. Here, we focus on an accelerator-based implementation of ART. We present a detailed performance study of our GPU-based adaptive radix tree (GRT) implementation over a variety of key distributions, synthetic benchmarks, and actual keys from music and book data sets. The performance is also compared with other index-searching schemes on the GPU. GRT on modern GPUs achieves some of the highest rates of index searches reported in the literature. For point queries, a throughput of up to 106 million and 130 million lookups per second is achieved for sparse and dense keys, respectively. For range queries, GRT yields 600 million and 1000 million lookups per second for sparse and dense keys, respectively, on a large dataset of 64 million 32-bit keys.

• Research Organization: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
• Sponsoring Organization: USDOE Laboratory Directed Research and Development (LDRD) Program
• DOE Contract Number: AC05-00OR22725
• OSTI ID: 1338492
• Resource Relation: Conference: The 2nd IEEE International Conference on Data Science and Systems, Sydney, Australia, 20161212, 20161214
• Country of Publication: United States
• Language: English