With modern computer architecture evolving, two problems conspire against the state-of-the- art approaches in parallel query execution:(i) to take advantage of many-cores, all query …
The architectural changes introduced with multi-core CPUs have triggered a redesign of main-memory join algorithms. In the last few years, two diverging views have appeared. One …
Analytical databases are continuously adapting to the underlying hardware in order to saturate all sources of parallelism. At the same time, hardware evolves in multiple directions …
In this paper we experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-) hash join. The relative performance of …
Evaluating the relational join is one of the central algorithmic and most well-studied problems in database systems. A staggering number of variants have been considered …
Big data applications often incur large costs in I/O, data transfer and copying overhead, especially when operating in cloud environments. Since most such computations are …
The explosive growth in digital data and its growing role in real-time decision support motivate the design of high-performance database management systems (DBMSs) …
MC Albutiu, A Kemper, T Neumann - arXiv preprint arXiv:1207.0145, 2012 - arxiv.org
Two emerging hardware trends will dominate the database system technology in the near future: increasing main memory capacities of several TB per server and massively parallel …
GPUs have long been discussed as accelerators for database query processing because of their high processing power and memory bandwidth. However, two main challenges limit the …