11231 search results - page 34 / 2247 » Digging for Data Structures |
ESA
2004
Springer
14 years 6 days 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 ...
DAWAK
2005
Springer
14 years 2 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...
RSA
2006
13 years 8 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...
POPL
1998
ACM
14 years 21 days 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...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...