Research indexJournal article
Parallel Selectivity Estimation for Optimizing Multidimensional Spatial Join Processing on GPUs
Zhang, You, Gruenwald
1 Apr 2017
NobleIDark:/48914/w1/20260524/FD3C8F43DOI10.1109/icde.2017.236
Parallel Selectivity Estimation for Optimizing Multidimensional Spatial Join Processing on GPUs
Zhang, You, Gruenwald · 2017 · Subscription
NobleIDark:/48914/w1/20260524/FD3C8F43DOI10.1109/icde.2017.236
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Processing large-scale data is typically memory intensive. The current generation of Graphics Processing Units (GPUs) has much lower memory capacity than CPUs which is often a limiting factor in processing large-scale data on GPUs. It is desirable to reduce memory footprint in spatially joining large-scale datasets through query optimization. In this study, we present a parallel selectivity estimation technique for optimizing spatial join processing on GPUs. By integrating the multi-dimensional cumulative histogram structure and the summed-area-table algorithm, our data parallel selectivity estimation technique can be efficiently realized on GPUs. Experiments on spatially joining two sets of Minimum Bounding Boxes (MBBs) derived from real point and polygon data, each with about one million MBBs, have shown that selectivity estimation at four grid levels took less than 1/3 of a second on a Nvidia GTX Titan GPU device. By using the best grid resolution, our technique saves 38.4% memory footprint for the spatial join.