Experimental Algorithms

Succinct representations of trees are an elegant solution to make large trees fit in main memory while still supporting navigational operations in constant time. However, their construction time remains a bottleneck. We introduce a practical parallel algorithm that improves the state of the art in succinct tree construction. Given a tree on n nodes stored as a sequence of balanced parentheses, our algorithm builds a succinct tree representation in O(n/p + lg p) time, where p is the number of available cores. The constructed representation uses 2n + o(n) bits of space and supports a rich set of operations in O(lg n) time. In experiments using up to 64 cores and on inputs of different sizes, our algorithm achieved good parallel speed-up. We also present an algorithm that takes O(n/p + lg p) time to construct the balanced parenthesis representation of the input tree required by our succinct tree construction algorithm.

[1]  Yusuke Nakamura,et al.  JSNP: a database of common gene variations in the Japanese population , 2002, Nucleic Acids Res..

[2]  T. Ralphs.  Duality and Warm Starting in Integer Programming , 2006 .

[3]  Guochuan Zhang,et al.  Online knapsack with resource augmentation , 2010, Inf. Process. Lett..

[4]  Sebastian Stiller,et al.  Packing a Knapsack of Unknown Capacity , 2017, SIAM J. Discret. Math..

[5]  Sebastian Maneth,et al.  Tree Transducers and Tree Compressions , 2004, FoSSaCS.

[6]  Abhi Shelat,et al.  The smallest grammar problem , 2005, IEEE Transactions on Information Theory.

[7]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[8]  Hiroshi Sakamoto,et al.  ESP-index: A compressed index based on edit-sensitive parsing , 2013, J. Discrete Algorithms.

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

[10]  Kazuo Iwama,et al.  Removable Online Knapsack Problems , 2002, ICALP.

[11]  Nicole Megow,et al.  Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints , 2013, ITCS '13.

[12]  John Noga,et al.  An online partially fractional knapsack problem , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

[13]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[14]  Anass Nagih,et al.  Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem , 2012, Comput. Oper. Res..

[15]  Alistair Moffat,et al.  From Theory to Practice: Plug and Play with Succinct Data Structures , 2013, SEA.

[16]  Sebastian Maneth,et al.  Efficient Memory Representation of XML Documents , 2005, DBPL.

[17]  Jirí Sgall,et al.  Online Knapsack Revisited , 2013, Theory of Computing Systems.

[18]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..

[19]  Elise Miller-Hooks,et al.  Updating Paths in Time-Varying Networks Given Arc Weight Changes , 2005, Transp. Sci..

[20]  Jing Li,et al.  A space efficient XML DOM parser , 2007, Data Knowl. Eng..

[21]  Martin W. P. Savelsbergh,et al.  Information-based branching schemes for binary linear mixed integer problems , 2009, Math. Program. Comput..

[22]  Kazuhisa Makino,et al.  Online removable knapsack problem under convex function , 2014, Theor. Comput. Sci..

[23]  Ted K. Ralphs,et al.  Decomposition in Integer Linear Programming , 2005 .

[24]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[25]  Daniele Frigioni,et al.  Recoverable Robustness in Shunting and Timetabling , 2009, Robust and Online Large-Scale Optimization.

[26]  Sebastian Maneth,et al.  The complexity of tree automata and XPath on grammar-compressed trees , 2006, Theor. Comput. Sci..

[27]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[28]  George S. Lueker,et al.  Average-case analysis of off-line and on-line knapsack problems , 1995, SODA '95.

[29]  Sebastian Maneth,et al.  XML tree structure compression using RePair , 2013, Inf. Syst..

[30]  Alistair Moffat,et al.  Off-line dictionary-based compression , 1999, Proceedings of the IEEE.

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

[32]  Carlo Vercellis,et al.  Stochastic on-line knapsack problems , 1995, Math. Program..

[33]  J. Papastavrou,et al.  The Dynamic and Stochastic Knapsack Problem with Deadlines , 1996 .

[34]  S. Das,et al.  Binary knapsack problems with random budgets , 2003, J. Oper. Res. Soc..

[35]  Mikkel Thorup,et al.  Maintaining information in fully dynamic trees with top trees , 2003, TALG.

[36]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.