Sciweavers

Share
ICDT
2016
ACM

Streaming Partitioning of Sequences and Trees

3 years 6 months ago
Streaming Partitioning of Sequences and Trees
We study streaming algorithms for partitioning integer sequences and trees. In the case of trees, we suppose that the input tree is provided by a stream consisting of a depth-first-traversal of the input tree. This captures the problem of partitioning XML streams, among other problems. We show that both problems admit deterministic (1+ )-approximation streaming algorithms, where a single pass is sufficient for integer sequences and two passes are required for trees. The space complexity for partitioning integer sequences is O(1 p log(nm)) and for partitioning trees is O(1 p2 log(nm)), where n is the length of the input stream, m is the maximal weight of an element in the stream, and p is the number of partitions to be created. Furthermore, for the problem of partitioning integer sequences, we show that computing an optimal solution in one pass requires Ω(n) space, and computing a (1 + )-approximation in one pass requires Ω(1 log n) space, rendering our algorithm tight for instanc...
Christian Konrad
Added 04 Apr 2016
Updated 04 Apr 2016
Type Journal
Year 2016
Where ICDT
Authors Christian Konrad
Comments (0)
books