Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Finding level-ancestors in trees
Journal of Computer and System Sciences
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Range queries in dynamic OLAP data cubes
Data & Knowledge Engineering
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Secure Dissemination of XML Content Using Structure-based Routing
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
Linear Verification For Spanning Trees
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Computing On A Free Tree Via Complexity-Preserving Mappings
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient Distributed Third-Party Data Authentication for Tree Hierarchies
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Hi-index | 0.00 |
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).