958 search results - page 94 / 192 » Efficient data structures for range-aggregate queries on tre... |
145
click to vote
DMIN
2006
15 years 5 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
134
click to vote
AMW
2009
15 years 5 months ago
2009
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
145
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
137
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
137
click to vote
CCCG
2006
15 years 5 months ago
2006
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...