## Succinct ordinal trees with level-ancestor queries (2004)

Venue: | In SODA ’04: Proceedings of the Fifteenth annual ACM-SIAM Symposium on Discrete Algorithms |

Citations: | 41 - 4 self |

### BibTeX

@INPROCEEDINGS{Geary04succinctordinal,

author = {Richard F. Geary and Rajeev Raman},

title = {Succinct ordinal trees with level-ancestor queries},

booktitle = {In SODA ’04: Proceedings of the Fifteenth annual ACM-SIAM Symposium on Discrete Algorithms},

year = {2004},

pages = {1--10}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider succinct or space-efficient representations of trees that efficiently support a variety of navigation operations. We focus on static ordinal trees, i.e., arbitrary static rooted trees where the children of each node are ordered. The set of operations is essentially the union of the sets of operations supported by previous succinct

### Citations

190 | Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
- RAMAN, RAMAN, et al.
- 2007
(Show Context)
Citation Context ...f 0 bits and 1 bits respectively in b1…bi, as well as supporting the operations SELECT0(i) and SELECT1(i), which report the indices of the i-th 0 bit and 1 bit respectively. Theorem 2.1 below is from =-=[18]-=-: THEOREM 2.1. A bitvector of length n can support RANK0(i), RANK1(i), SELECT0(i) and n SELECT1(i) in O(1) time, using lg( ) + O(n lg lg n / lg n) bits, where m is the number of bits that have value 1... |

170 |
Space-efficient static trees and graphs
- JACOBSON
- 1989
(Show Context)
Citation Context ...xplicit storage of trees, with a pointer per child as well as other structural information, is often taken as a given, but can account for the dominant storage cost. This cost can be prohibitive (see =-=[4, 9, 15, 16]-=- for examples). Our focus is on static ordinal trees, i.e., arbitrary static rooted trees where the children of each node are ordered. Following the early work of Jacobson [15] there have been some mo... |

154 |
XML path language (XPath) version 1.0
- Clark, DeRose
- 1999
(Show Context)
Citation Context ...al trees is obvious and well understood (see Figure 1.2 for a simplified example). The XML document object model (DOM) [14] provides a framework to access XML documents using the query language XPath =-=[10]-=-. Unfortunately, an implementation of the DOM (using explicit storage of the tree with several pointers per node) can take up many times more memory space than the equivalent raw XML file (which is al... |

140 | Succinct Representation of Balanced Parentheses and Static Trees
- Munro, Raman
(Show Context)
Citation Context ...xplicit storage of trees, with a pointer per child as well as other structural information, is often taken as a given, but can account for the dominant storage cost. This cost can be prohibitive (see =-=[4, 9, 15, 16]-=- for examples). Our focus is on static ordinal trees, i.e., arbitrary static rooted trees where the children of each node are ordered. Following the early work of Jacobson [15] there have been some mo... |

82 |
Efficient suffix trees on secondary storage (extended abstract
- Clark, Munro
- 1996
(Show Context)
Citation Context ...xplicit storage of trees, with a pointer per child as well as other structural information, is often taken as a given, but can account for the dominant storage cost. This cost can be prohibitive (see =-=[4, 9, 15, 16]-=- for examples). Our focus is on static ordinal trees, i.e., arbitrary static rooted trees where the children of each node are ordered. Following the early work of Jacobson [15] there have been some mo... |

71 | Representing trees of higher degree
- BENOIT, DEMAINE, et al.
- 2005
(Show Context)
Citation Context ...i (1, 5) 1 4 3 treei (2, 6.a) ( ( ( ) ) ) ( ( ( ( ( ) ( ) ) ) ( ) ) ) ( ( ( ) ) ) (6.b) n/a ( ( ( ) ( ) ) ) n/a nodetypesi (3, 7) 0 0 1 1 1 0 1 0 0 Λ edgesi (4.a, 8.a) 0 1 1 1 1 Λ (τ2) (4.b, 8.b) [2] =-=[2, 3, 5]-=- [ ] (τ1) (4.b, 8.b) [2] [ ] [ ] di (9) 2 4 4 childi (mini) (9) 1 0 1 0 0 0 1 0 0 0 (micro) (9) 1 0 1 0 0 0 1 0 1 0 edgesi (τ1) (10) [ ] [ ] [ ] (τ2) (10) [ ] [ ] [2] Figure 4.1 Example representation... |

52 | Structuring labeled trees for optimal succinctness, and beyond - Ferragina, Luccio, et al. - 2005 |

38 | The level ancestor problem simplified
- Bender, Farach-Colton
(Show Context)
Citation Context ...ries is known as the level-ancestor problem, which has a number of algorithmic applications (see [7, 11, 12]). A number of O(1)- time, Θ(n lg n)-bit representations have been devised for this problem =-=[1, 3, 6, 11]-=-. Previous tree representations using 2n + o(n) bits only supported a proper subset of these operations. Jacobson's LOUDS (level order unary degree sequence) representation [15] represents a node of d... |

36 |
Computing on a Free Tree via Complexity-Preserving Mappings
- Chazelle
- 1987
(Show Context)
Citation Context ...; and • ANC(x, i): for i ≥ 0 return the i-th ancestor of node x. Representing a tree to support ANC queries is known as the level-ancestor problem, which has a number of algorithmic applications (see =-=[7, 11, 12]-=-). A number of O(1)- time, Θ(n lg n)-bit representations have been devised for this problem [1, 3, 6, 11]. Previous tree representations using 2n + o(n) bits only supported a proper subset of these op... |

33 |
Finding level-ancestors in trees
- Berkman, Vishkin
- 1994
(Show Context)
Citation Context ...ries is known as the level-ancestor problem, which has a number of algorithmic applications (see [7, 11, 12]). A number of O(1)- time, Θ(n lg n)-bit representations have been devised for this problem =-=[1, 3, 6, 11]-=-. Previous tree representations using 2n + o(n) bits only supported a proper subset of these operations. Jacobson's LOUDS (level order unary degree sequence) representation [15] represents a node of d... |

19 | Succinct representations of functions - MUNRO, RAO |

16 | Improved algorithms for finding level ancestors in dynamic trees
- Alstrup, Holm
- 2000
(Show Context)
Citation Context ...ries is known as the level-ancestor problem, which has a number of algorithmic applications (see [7, 11, 12]). A number of O(1)- time, Θ(n lg n)-bit representations have been devised for this problem =-=[1, 3, 6, 11]-=-. Previous tree representations using 2n + o(n) bits only supported a proper subset of these operations. Jacobson's LOUDS (level order unary degree sequence) representation [15] represents a node of d... |

16 | Document Object Model (DOM) Level 2 Core Specification
- Hors, Hégaret, et al.
- 2000
(Show Context)
Citation Context ...(large, static) XML documents. The correspondence between XML documents and ordinal trees is obvious and well understood (see Figure 1.2 for a simplified example). The XML document object model (DOM) =-=[14]-=- provides a framework to access XML documents using the query language XPath [10]. Unfortunately, an implementation of the DOM (using explicit storage of the tree with several pointers per node) can t... |

14 |
Representing trees of higher degree, Algorithmica
- Benoit, Demaine, et al.
- 2005
(Show Context)
Citation Context |

13 |
Finding level-ancestors in dynamic trees
- Dietz
- 1991
(Show Context)
Citation Context ...; and • ANC(x, i): for i ≥ 0 return the i-th ancestor of node x. Representing a tree to support ANC queries is known as the level-ancestor problem, which has a number of algorithmic applications (see =-=[7, 11, 12]-=-). A number of O(1)- time, Θ(n lg n)-bit representations have been devised for this problem [1, 3, 6, 11]. Previous tree representations using 2n + o(n) bits only supported a proper subset of these op... |

11 | Orderly spanning trees with applications
- Chiang, Lin, et al.
(Show Context)
Citation Context ...n nodes, with three different 2n-bit representations. {RANK, SELECT}pre {RANK, SELECT}post CHILD DEG CHILDRANK DEPTH DESC ANC LOUDS [15] � � � � � � � � Parenthesis [16] � � � � � � � � Parenthesis-a =-=[8]-=- � � � � � � � � Parenthesis-b [17] � � � � � � � � DFUDS [4, 5] � � � � � � � � New � � � � � � � � Table 1.1 Functionality of previous representations. An entry of � or � indicates whether the repre... |

10 | Perfect Hashing for Strings: Formalization and Algorithms
- Farach, Muthukrishnan
- 1996
(Show Context)
Citation Context ...; and • ANC(x, i): for i ≥ 0 return the i-th ancestor of node x. Representing a tree to support ANC queries is known as the level-ancestor problem, which has a number of algorithmic applications (see =-=[7, 11, 12]-=-). A number of O(1)- time, Θ(n lg n)-bit representations have been devised for this problem [1, 3, 6, 11]. Previous tree representations using 2n + o(n) bits only supported a proper subset of these op... |

1 |
Apache Xindice: Frequently Asked Questions. http://xml.apache.org/xindice/faq.html
- FOUNDATION
- 2005
(Show Context)
Citation Context ...ters per node) can take up many times more memory space than the equivalent raw XML file (which is already verbose). This ‘XML bloat’ significantly impedes scalability of current XML query processors =-=[2]-=-. Our data structure gives an XML representation that supports the axis specifiers in XPath location path expressions (LPE). An XPath LPE refers to a node, or an ordered node set in the document tree.... |