We are at the beginning of a genomic revolution in which all known species are planned to be sequenced. Accessing such data for comparative analyses is crucial in this new age of …
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 …
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with …
S Blanas, Y Li, JM Patel - Proceedings of the 2011 ACM SIGMOD …, 2011 - dl.acm.org
The focus of this paper is on investigating efficient hash join algorithms for modern multi- core processors in main memory environments. This paper dissects each internal phase of a …
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) …