An improved succinct representation for dynamic k -ary trees.pptVIP

An improved succinct representation for dynamic k-ary trees Diego Arroyuelo Department of Computer Science, University of Chile k-ary trees (tries) Succinct data structures A succinct data structure requires space close to the information-theoretic lower bound There are different k-ary trees with n nodes Therefore, the information-theoretical lower bound is about bits Succinct data structures parent(x) child(x, i) child(x, a) depth(x) degree(x) subtree-size(x) preorder(x) insertions (in the leaves) deletions (in the leaves) Succinct tree representations (static) Succinct representations for static trees: LOUDS [Jacobson, FOCS’89] Balanced Parentheses [MR, STOC’97] DFUDS [Benoit et al., Algorithmica 2005] xbw [Ferragina et al., FOCS’05] Ultra succinct trees [Jansson et al., SODA’07] These must be rebuilt from scratch upon insertion or deletion of nodes Succinct tree representations (static) Succinct tree representations (dynamic) The case of succinct dynamic trees was first studied for binary trees only Munro, Raman, and Storm [SODA’01]: 2n + o(n) bit Raman and Rao [ICALP’03]: 2n + o(n) bits k-ary trees: basic navigation in O(k) time  Chan et al. [TALG 2007]: 2n + nlog k + o(nlog k) bits Operation times related to n rather than to k (O(log n) time) It cannot take advantage of asymptotically smaller values of k e.g., k = O(polylog(n)) Our basic tree representation We incrementally divide the tree into disjoint blocks[Munro et al., Raman and Rao] Every block represents a connected component of N nodes such that Nmin ≤ N ≤ Nmax We arrange these blocks in a tree by adding inter-block pointers (entire tree is tree of subtrees) Our basic tree representation Our basic tree representation We define Nmin (minimum block size) as follows Inter-block pointers should use o(n) bits By choosing Nmin = Q(log2n) we have O(n / log2n) blocks(In general, Nmin = Q(log n f(n)), for f(n) = w(1