We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-tuned algorithms on a multi-level memory hierarchy. This automaticity is because cache-oblivious algorithms assume no knowledge about any specific parameter values, such as the capacity and block size of each level of the hierarchy. As a first step, we propose recursive partitioning to implement cache-oblivious nested-loop joins (NLJs) without indexes, and recursive clustering and buffering to implement cache-oblivious NLJs with indexes. Our theoretical results and empirical evaluation on three different architectures show that our cache-oblivious NLJs match the pe...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
The non-overlapping indexing problem is defined as follows: pre-process a given text T[1, n] of leng...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...
We propose a radical approach to relational query processing that aims at automatically and consiste...
We propose to demonstrate EaseDB, the first cache-oblivious queryprocessor for in-memory relational ...
Cache-oblivious techniques, proposed in the theory community, have optimal asymptotic bounds on the ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
Cache-obliviousness is a concept first introduced by Frigo et al. in [1]. We follow their model and ...
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of ...
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the ...
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the ...
As CPUs become more powerful with Moore's law and memory latencies stay constant, the impact of the ...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion,...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
The non-overlapping indexing problem is defined as follows: pre-process a given text T[1, n] of leng...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...
We propose a radical approach to relational query processing that aims at automatically and consiste...
We propose to demonstrate EaseDB, the first cache-oblivious queryprocessor for in-memory relational ...
Cache-oblivious techniques, proposed in the theory community, have optimal asymptotic bounds on the ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
Cache-obliviousness is a concept first introduced by Frigo et al. in [1]. We follow their model and ...
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of ...
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the ...
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the ...
As CPUs become more powerful with Moore's law and memory latencies stay constant, the impact of the ...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion,...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
The non-overlapping indexing problem is defined as follows: pre-process a given text T[1, n] of leng...
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to ...