Sciweavers

Share
ICDT
2009
ACM

Efficient data structures for range-aggregate queries on trees

9 years 10 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the MIN in a query subtree consisting of the nodes reachable from a node u along paths of length k (u and k are query parameters). The same problem is well solved when the aggregation is SUM rather than MIN, but the solutions rely on additive inverses for the "+" operator, and they fail for the MIN aggregation which is the topic of this paper. For the directed (rooted tree) case, we give an O(n) space, constant query time solution. For the undirected case, the space complexity is O(n log n) and the query time is O(log n). Categories and Subject Descriptors E.1 [Data Structures]: Trees General Terms Algorithms Keywords Range aggregation, query answering
Hao Yuan, Mikhail J. Atallah
Added 21 Nov 2009
Updated 21 Nov 2009
Type Conference
Year 2009
Where ICDT
Authors Hao Yuan, Mikhail J. Atallah
Comments (0)
books