Succinct Representations of Ordinal Trees

We survey succinct representations of ordinal, or rooted, ordered trees. Succinct representations use space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time.

[1]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[2]  Ian H. Witten,et al.  Bonsai: A compact representation of trees , 1993, Softw. Pract. Exp..

[3]  Rajeev Raman,et al.  Succinct Dynamic Dictionaries and Trees , 2003, ICALP.

[4]  Naila Rahman,et al.  A simple optimal representation for balanced parentheses , 2006, Theor. Comput. Sci..

[5]  S. Srinivasa Rao,et al.  Succinct Representations of Functions , 2004, ICALP.

[6]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[7]  Hsueh-I Lu,et al.  Balanced parentheses strike back , 2008, TALG.

[8]  Stefan Kurtz,et al.  Reducing the space requirement of suffix trees , 1999 .

[9]  Stelios Joannou,et al.  Dynamizing Succinct Tree Representations , 2012, SEA.

[10]  Yasuo Tabei,et al.  Succinct Multibit Tree: Compact Representation of Multibit Trees by Using Succinct Data Structures in Chemical Fingerprint Searches , 2012, WABI.

[11]  Naila Rahman,et al.  Engineering the LOUDS Succinct Tree Representation , 2006, WEA.

[12]  Kunihiko Sadakane,et al.  Ultra-succinct representation of ordered trees with applications , 2012, J. Comput. Syst. Sci..

[13]  Venkatesh Raman,et al.  Representing dynamic binary trees succinctly , 2001, SODA '01.

[14]  Yi-Ting Chiang,et al.  Orderly Spanning Trees with Applications , 2001, SIAM J. Comput..

[15]  Gonzalo Navarro,et al.  Succinct Trees in Practice , 2010, ALENEX.

[16]  Michael Hoffmann,et al.  Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings , 2007, ESA.

[17]  Peter Bro Miltersen,et al.  The Cell Probe Complexity of Succinct Data Structures , 2003 .

[18]  Erkki Mäkinen,et al.  Tree Compression and Optimization with Applications , 1990, Int. J. Found. Comput. Sci..

[19]  J. Ian Munro,et al.  A Uniform Approach Towards Succinct Representation of Trees , 2008, SWAT.

[20]  Gonzalo Navarro,et al.  Fast in-memory XPath search using compressed indexes , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[21]  S. Srinivasa Rao,et al.  Succinct Ordinal Trees Based on Tree Covering , 2007, ICALP.

[22]  J. Ian Munro,et al.  Efficient Suffix Trees on Secondary Storage (extended Abstract) , 1996, SODA.

[23]  Giuseppe Ottaviano,et al.  Design of Practical Succinct Data Structures for Large Data Collections , 2013, SEA.

[24]  Alfred V. Aho,et al.  On Finding Lowest Common Ancestors in Trees , 1976, SIAM J. Comput..

[25]  S. Srinivasa Rao,et al.  Space Efficient Suffix Trees , 1998, J. Algorithms.

[26]  Uzi Vishkin,et al.  Finding Level-Ancestors in Trees , 1994, J. Comput. Syst. Sci..

[27]  Rajeev Raman,et al.  Representing Trees of Higher Degree , 2005, Algorithmica.

[28]  Rajeev Raman,et al.  Universal Succinct Representations of Trees? , 2009, ICALP.

[29]  J. Ian Munro,et al.  Succinct representation of dynamic trees , 2011, Theor. Comput. Sci..

[30]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[31]  Rajeev Raman,et al.  Encoding 2D Range Maximum Queries , 2011, ISAAC.

[32]  R. V. Stee,et al.  Packing Rectangles into 2 OPT Bins Using Rotations , 2008 .

[33]  Milan Ruzic,et al.  Uniform deterministic dictionaries , 2008, TALG.

[34]  Gonzalo Navarro,et al.  Fully-functional succinct trees , 2010, SODA '10.

[35]  S. Srinivasa Rao,et al.  Succinct indexes for strings, binary relations and multilabeled trees , 2011, TALG.

[36]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[37]  Rajeev Raman,et al.  Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.

[38]  Kurt Mehlhorn,et al.  The cost of address translation , 2012, ALENEX.

[39]  Rita Casadio,et al.  Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.

[40]  Naila Rahman,et al.  Engineering succinct DOM , 2008, EDBT '08.

[41]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[42]  Rajeev Raman,et al.  On the Size of Succinct Indices , 2007, ESA.

[43]  Fabrizio Luccio,et al.  Compressing and indexing labeled trees, with applications , 2009, JACM.

[44]  David Richard Clark,et al.  Compact pat trees , 1998 .

[45]  Gad M. Landau,et al.  Random access to grammar-compressed strings , 2010, SODA '11.