958 search results - page 61 / 192 » Efficient data structures for range-aggregate queries on tre... |
107
Voted
DAWAK
1999
Springer
15 years 4 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
108
click to vote
MICS
2010
14 years 11 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
130
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
110
click to vote
DBA
2004
15 years 1 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
204
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Answering queries using materialized views has been well studied in the context of structured queries and has shown significant performance benefits. Despite the popularity of keyw...