958 search results - page 32 / 192 » Efficient data structures for range-aggregate queries on tre... |
107
click to vote
DAWAK
2001
Springer
15 years 5 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
103
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
109
Voted
DATESO
2009
14 years 10 months ago
2009
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
85
Voted
ICALP
1999
Springer
15 years 4 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
108
Voted
BROADNETS
2004
IEEE
15 years 4 months ago
2004
IEEE
One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storag...