11212 search results - page 124 / 2243 » Semi-persistent Data Structures |
126
click to vote
FOCS
1992
IEEE
15 years 6 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
106
click to vote
DAWAK
2003
Springer
15 years 7 months ago
2003
Springer
Data Warehouses provide sophisticated tools for analyzing complex data online, in particular by aggregating data along dimensions spanned by master data. Changes to these master da...
121
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
145
click to vote
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural...