Efficient Relational Algebra Algorithms and Data Structures for GPU

Relational databases remain an important application domain for organizing and analyzing the massive volume of data generated as sensor technology, retail and inventory transactions, social media, computer vision, and new fields continue to evolve. At the same time, processor architectures are beginning to shift towards hierarchical and parallel architectures employing throughput-optimized memory systems, lightweight multi-threading, and Single-Instruction Multiple-Data (SIMD) core organizations. Examples include general purpose Graphics Processing Units (GPUs) such as NVIDIA's Fermi, Intels Sandy Bridge, and AMD's Fusion processors.

Provided by: Georgia Institute of Technology Topic: Data Management Date Added: Feb 2012 Format: PDF

Find By Topic