We propose to demonstrate EaseDB, the first cache-oblivious queryprocessor for in-memory relational query processing. The cache-oblivious notion from the theory community refers to the property that no parameters in an algorithm or a data structure need to be tuned for a specific memory hierarchy for optimality. As a result, EaseDB automatically optimizes the cache performance as well as the overall performance of query processing on any memory hierarchy. We have developed a visualization interface to show the detailed performance of EaseDB in comparison with its cache-conscious counterpart, with both the parameters in the cache-conscious algorithms and the hardware platforms varied
The primary goal of the database system is to provide the user a convenient and efficient access to ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...
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 ...
We propose a radical approach to relational query processing that aims at automatically and consiste...
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal...
This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by em-piri...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.In the second part of this wo...
As more and more query processing work can be done in main memory, memory access is becoming a signi...
access method, cache consciousness, data locality, data structure, main-memory database The recent h...
Cache-oblivious algorithms are designed to be executed on the ideal-cache machine, an abstract machi...
In this paper, we describe heuristic rules for choosing an appropriate access path for a given query...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
The hash table, especially its external memory version, is one of the most important index structure...
The primary goal of the database system is to provide the user a convenient and efficient access to ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...
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 ...
We propose a radical approach to relational query processing that aims at automatically and consiste...
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal...
This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by em-piri...
133 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.In the second part of this wo...
As more and more query processing work can be done in main memory, memory access is becoming a signi...
access method, cache consciousness, data locality, data structure, main-memory database The recent h...
Cache-oblivious algorithms are designed to be executed on the ideal-cache machine, an abstract machi...
In this paper, we describe heuristic rules for choosing an appropriate access path for a given query...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
The hash table, especially its external memory version, is one of the most important index structure...
The primary goal of the database system is to provide the user a convenient and efficient access to ...
In this paper we explore a simple and general approach for developing parallel algorithms that lead ...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...