Sciweavers

11214 search results - page 57 / 2243
» Just-in-time data structures
Sort
View
DAWAK
2005
Springer
14 years 3 months ago
A Tree Comparison Approach to Detect Changes in Data Warehouse Structures
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...
Johann Eder, Christian Koncilia, Karl Wiggisser
RSA
2006
144views more  RSA 2006»
13 years 10 months ago
Data structures with dynamical random transitions
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...
Clément Dombry, Nadine Guillotin-Plantard, ...
POPL
1998
ACM
14 years 2 months ago
A Functional Representation of Data Structures with a Hole
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...
Yasuhiko Minamide
STACS
2009
Springer
14 years 4 months ago
Error-Correcting Data Structures
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...
Ronald de Wolf
IWPC
2006
IEEE
14 years 4 months ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge