11213 search results - page 78 / 2243 » Low-contention data structures |
120
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
133
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
121
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
168
Voted
RSA
2006
15 years 3 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
113
Voted
POPL
1998
ACM
15 years 7 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...