1. D. Arroyuelo, F. Claude, S. Maneth, V. Mäkinen, G. Navarro, K. Nguyen, J. Sirén & N. Välimäki (2010): Fast in-memory XPath search using compressed indexes. In: ICDE, pp. 417–428, doi:10.1109/ICDE.2010.5447858.
  2. P. Buneman, M. Grohe & C. Koch (2003): Path Queries on Compressed XML. In: VLDB, pp. 141–152.
  3. G. Busatto, M. Lohrey & S. Maneth (2008): Efficient memory representation of XML document trees. Inf. Syst. 33(4-5), pp. 456–474, doi:10.1016/
  4. T. H. Cormen, C. E. Leiserson, R. L. Rivest & C. Stein (2001): Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company.
  5. D. K. Fisher & S. Maneth (2007): Structural Selectivity Estimation for XML Documents. In: ICDE, pp. 626–635, doi:10.1109/ICDE.2007.367908.
  6. M. Frick, M. Grohe & C. Koch (2003): Query Evaluation on Compressed Trees (Extended Abstract). In: LICS, pp. 188–197, doi:10.1109/LICS.2003.1210058.
  7. T J. Green, A. Gupta, G. Miklau, M. Onizuka & D. Suciu (2004): Processing XML streams with deterministic automata and stream indexes. ACM Trans. Database Syst. 29(4), pp. 752–788, doi:10.1145/1042046.1042051.
  8. D. E. Knuth, J. H. Morris Jr. & V. R. Pratt (1977): Fast Pattern Matching in Strings. SIAM J. Comput. 6(2), pp. 323–350, doi:10.1137/0206024.
  9. J. Lamping (1990): An Algorithm for Optimal Lambda Calculus Reduction. In: POPL, pp. 16–30, doi:10.1145/96709.96711.
  10. M. Lohrey & S. Maneth (2006): The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2), pp. 196–210, doi:10.1016/j.tcs.2006.07.024.
  11. M. Lohrey, S. Maneth & R. Mennicke (2013): XML Tree Structure Compression using RePair. Information Systems 38(8), pp. 1150–1167.
  12. M. Lohrey, S. Maneth & E. Noeth (2013): XML compression via DAGs. In: ICDT, pp. 69–80, doi:10.1145/2448496.2448506.
  13. S. Maneth & K. Nguyen (2010): XPath Whole Query Optimization. PVLDB 3(1), pp. 882–893.
  14. S. Maneth & T. Sebastian (2010): Fast and Tiny Structural Self-Indexes for XML. CoRR abs/1012.5696.
  15. A. Neumann & H. Seidl (1998): Locating Matches of Tree Patterns in Forests. In: FSTTCS, pp. 134–145, doi:10.1007/978-3-540-49382-2_12.
  16. F. Neven & T. Schwentick (2002): Query automata over finite trees. Theor. Comput. Sci. 275(1-2), pp. 633–674, doi:10.1016/S0304-3975(01)00301-2.
  17. J. Niehren, L. Planque, J.-M. Talbot & S. Tison (2005): N-Ary Queries by Tree Automata. In: DBPL, pp. 217–231, doi:10.1007/11601524_14.

Comments and questions to:
For website issues: