As CPUs become more powerful with Moore's law and memory latencies stay constant, the impact of the memory access performance bottleneck continues to grow on relational operators like join, which can exhibit random access on a memory region larger than the hardware caches. While cache-conscious variants for various relational algorithms have been described, previous work has mostly ignored (the cost of) projection columns. However, real-life joins almost always come with projections, such that proper projection column manipulation should be an integral part of any generic join algori
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal...
ABSTRACT Computing an equi-join followed by a duplicate eliminating projection is conventionally don...
Abstract. Parallel graph reduction is a model for parallel program exe-cution in which shared-memory...
As CPUs become more powerful with Moore's law and memory latencies stay constant, the impact of the ...
As CPUs become more powerful with Moore\'s law and memory latencies stay constant, the impact of the...
In the past decade, the exponential growth in commodity CPUs speed has far outpaced advances in memo...
The architectural changes introduced with multicore CPUs have triggered a redesign of main-memory jo...
Abstract—The architectural changes introduced with multi-core CPUs have triggered a redesign of main...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
Abstract. We study the behaviour of an algorithm which compresses relational tables by representing ...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
Because of the infeasibility or expense of large fully-associative caches, cache memories are often ...
Performance tuning becomes harder as computer technology advances. One of the factors is the increas...
iv Due to recent advancements in hardware technology, main-memory database systems are gaining more ...
This paper proposes an optimization by an alternative approach to memory mapping. Caches with low se...
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal...
ABSTRACT Computing an equi-join followed by a duplicate eliminating projection is conventionally don...
Abstract. Parallel graph reduction is a model for parallel program exe-cution in which shared-memory...
As CPUs become more powerful with Moore's law and memory latencies stay constant, the impact of the ...
As CPUs become more powerful with Moore\'s law and memory latencies stay constant, the impact of the...
In the past decade, the exponential growth in commodity CPUs speed has far outpaced advances in memo...
The architectural changes introduced with multicore CPUs have triggered a redesign of main-memory jo...
Abstract—The architectural changes introduced with multi-core CPUs have triggered a redesign of main...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
Abstract. We study the behaviour of an algorithm which compresses relational tables by representing ...
In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latenc...
Because of the infeasibility or expense of large fully-associative caches, cache memories are often ...
Performance tuning becomes harder as computer technology advances. One of the factors is the increas...
iv Due to recent advancements in hardware technology, main-memory database systems are gaining more ...
This paper proposes an optimization by an alternative approach to memory mapping. Caches with low se...
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal...
ABSTRACT Computing an equi-join followed by a duplicate eliminating projection is conventionally don...
Abstract. Parallel graph reduction is a model for parallel program exe-cution in which shared-memory...