Refine
Year of publication
- 2015 (1)
Document Type
Conference Type
- Konferenzartikel (1)
Language
- English (1)
Has Fulltext
- no (1) (remove)
Is part of the Bibliography
- yes (1) (remove)
Keywords
- Analytical Query (1)
- Datenbank (1)
- Filter Dimension (1)
- Hash Function (1)
- Hash Table (1)
- Informationssystem (1)
- Target Path (1)
Open Access
- Closed Access (1)
In online analytical processing (OLAP), filtering elements of a given dimensional attribute according to the value of a measure attribute is an essential operation, for example in top-k evaluation. Such filters can involve extremely large amounts of data to be processed, in particular when the filter condition includes “quantification” such as ANY or ALL, where large slices of an OLAP cube have to be computed and inspected. Due to the sparsity of OLAP cubes, the slices serving as input to the filter are usually sparse as well, presenting a challenge for GPU approaches which need to work with a limited amount of memory for holding intermediate results. Our CUDA solution involves a hashing scheme specifically designed for frequent and parallel updates, including several optimizations exploiting architectural features of Nvidia’s Fermi and Kepler GPUs.