Breaking skyline computation down to the metal: the skyline breaker algorithm
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
Due to stagnant clock speeds and high power consumption of commodity microprocessors, database vendors have started to explore massively parallel co-processors such as FPGAs to further increase performance. A typical approach is to push simple but compute-intensive operations (e.g., pre-filtering, (de)compression) to FPGAs for acceleration. In this paper, we show how a significantly more complex operation - the computation of the skyline - can be holistically implemented on an FPGA. A skyline query computes the pare to optimal set of multi-dimensional data points. These queries have been studied in software extensively over the last decade but this paper is the first to examine skyline computation in hardware. We propose a methodology that interleaves data storage and computation, allowing multiple operations to be executed on the same working set in parallel, while accounting for all data dependencies. Our experiments show that we achieve very promising results compared to CPU-based solutions.