958 search results - page 66 / 192 » Efficient data structures for range-aggregate queries on tre... |
93
Voted
OPODIS
2004
15 years 1 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
191
Voted
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
103
click to vote
SCCC
2003
IEEE
15 years 5 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
128
Voted
CACM
1998
15 years 8 days ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
96
Voted
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...