Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent. © 2014 Springer-Verlag Berlin Heidelberg.SCOPUS: cp.kinfo:eu-repo/semantics/publishe
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
Cache memories have a strong impact on the response time of tasks executed on modern computing platf...
Partial persistence is a general transformation that takes a data structure and allows queries to be...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...
A data structure is said to be persistent when any update operation returns a new structure without ...
The continuous partial match query is a partial match query whose result continues to exist consiste...
In this paper, abstract interpretation is applied to the problem of predicting the cache behavior of...
Cache-oblivious algorithms are well understood when the cache size remains constant. Recently variab...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
We propose a radical approach to relational query processing that aims at automatically and consiste...
Abstract. We study the problem of maintaining a dynamic ordered set subject to insertions, deletions...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
Cache memories have a strong impact on the response time of tasks executed on modern computing platf...
Partial persistence is a general transformation that takes a data structure and allows queries to be...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...
A data structure is said to be persistent when any update operation returns a new structure without ...
The continuous partial match query is a partial match query whose result continues to exist consiste...
In this paper, abstract interpretation is applied to the problem of predicting the cache behavior of...
Cache-oblivious algorithms are well understood when the cache size remains constant. Recently variab...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
We propose a radical approach to relational query processing that aims at automatically and consiste...
Abstract. We study the problem of maintaining a dynamic ordered set subject to insertions, deletions...
This paper is a study of persistence in data structures. Ordinary data structures are ephemeral in t...
AbstractThis paper is a study of persistence in data structures. Ordinary data structures are epheme...
This thesis discusses cache oblivious data structures. These are structures which have good cachin...
Cache memories have a strong impact on the response time of tasks executed on modern computing platf...