Skip to main content
SpringerLink
Log in

Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata

  • Conference paper
  • First Online:
Computer Science – Theory and Applications (CSR 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12159))

Included in the following conference series:

  • 656 Accesses

Abstract

We study the problem of whether regular expressions for nested words can be compiled to small deterministic nested word automata (NWAs). In theory, we obtain a positive answer for small deterministic regular expressions for nested words. In practice of navigational path queries, nondeterministic NWAs are obtained for which NWA determinization explodes. We show that practical good solutions can be obtained by using stepwise hedge automata as intermediates.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alur, R.: Marrying words and trees. In: 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 233–242. ACM Press (2007). https://doi.org/10.1145/1265530.1265564

  2. Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102–1114. Springer, Heidelberg (2005). https://doi.org/10.1007/11523468_89

    Chapter  MATH  Google Scholar 

  3. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: 36th ACM Symposium on Theory of Computing, pp. 202–211. ACM Press (2004). http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=1007390

  4. Benedikt, M., Jeffrey, A., Ley-Wild, R.: Stream firewalling of XML constraints. In: ACM SIGMOD International Conference on Management of Data, pp. 487–498. ACM Press (2008)

    Google Scholar 

  5. Bozzelli, L., Sánchez, C.: Visibly rational expressions. Acta Inf. 51(1), 25–49 (2014). https://doi.org/10.1007/s00236-013-0190-6

    Article  MathSciNet  MATH  Google Scholar 

  6. Brüggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120(2), 197–213 (1993). https://doi.org/10.1016/0304-3975(93)90287-4

    Article  MathSciNet  MATH  Google Scholar 

  7. Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182–206 (1998)

    Article  MathSciNet  Google Scholar 

  8. Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105–118. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25979-4_8. http://www.ps.uni-sb.de/Papers/abstracts/stepwise.html

    Chapter  Google Scholar 

  9. Champavère, J., Gilleron, R., Lemay, A., Niehren, J.: Efficient inclusion checking for deterministic tree automata and XML schemas. Inf. Comput. 207(11), 1181–1208 (2009). https://doi.org/10.1016/j.ic.2009.03.003

    Article  MathSciNet  MATH  Google Scholar 

  10. Comon, H., et al.: Tree automata techniques and applications, October 2007. http://tata.gforge.inria.fr. Accessed 1997

  11. D’Antoni, L., Alur, R.: Symbolic visibly pushdown automata. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 209–225. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08867-9_14

    Chapter  Google Scholar 

  12. Debarbieux, D., Gauwin, O., Niehren, J., Sebastian, T., Zergaoui, M.: Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578, 100–125 (2015). https://doi.org/10.1016/j.tcs.2015.01.017

    Article  MathSciNet  MATH  Google Scholar 

  13. Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194–211 (1979). https://doi.org/10.1016/0022-0000(79)90046-1

    Article  MathSciNet  MATH  Google Scholar 

  14. Franceschet, M.: XPathMark performance test. https://users.dimi.uniud.it/~massimo.franceschet/xpathmark/PTbench.html. Accessed 30 Mar 2020

  15. Gauwin, O., Niehren, J.: Streamable fragments of forward XPath. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 3–15. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22256-6_2

    Chapter  MATH  Google Scholar 

  16. Gauwin, O., Niehren, J., Tison, S.: Earliest query answering for deterministic nested word automata. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 121–132. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03409-1_12. http://hal.inria.fr/inria-00390236/en

    Chapter  Google Scholar 

  17. Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 179–190 (2003)

    Google Scholar 

  18. Grez, A., Riveros, C., Ugarte, M.: A formal framework for complex event processing. In: Barceló, P., Calautti, M. (eds.) 22nd International Conference on Database Theory, ICDT 2019. LIPIcs, Lisbon, Portugal, 26–28 March 2019, vol. 127, pp. 5:1–5:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019). https://doi.org/10.4230/LIPIcs.ICDT.2019.5

  19. Hosoya, H., Pierce, B.C.: XDuce: a statically typed XML processing language. ACM Trans. Internet Technol. 3(2), 117–148 (2003). https://doi.org/10.1145/767193.767195

    Article  Google Scholar 

  20. Martens, W., Niehren, J.: On the minimization of XML-schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73(4), 550–583 (2007). https://doi.org/10.1016/j.jcss.2006.10.021. https://hal.inria.fr/inria-00088406. Special issue of DBPL 05

    Article  MathSciNet  MATH  Google Scholar 

  21. Mozafari, B., Zeng, K., Zaniolo, C.: From regular expressions to nested words: unifying languages and query execution for relational and XML sequences. PVLDB 3(1), 150–161 (2010). https://doi.org/10.14778/1920841.1920865. http://www.vldb.org/pvldb/vldb2010/pvldb_vol3/R13.pdf

  22. Mozafari, B., Zeng, K., Zaniolo, C.: High-performance complex event processing over XML streams. In: Candan, K.S., et al. (eds.) SIGMOD Conference, pp. 253–264. ACM (2012). https://doi.org/10.1145/2213836.2213866

  23. Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Ramanujam, S. (eds.) FSTTCS 1998. LNCS, vol. 1530, pp. 134–145. Springer, Heidelberg (1998). https://doi.org/10.1007/978-3-540-49382-2_12

    Chapter  Google Scholar 

  24. Olteanu, D.: SPEX: streamed and progressive evaluation of XPath. IEEE Trans. Know. Data Eng. 19(7), 934–949 (2007). https://doi.org/10.1109/TKDE.2007.1063

    Article  Google Scholar 

  25. Pitcher, C.: Visibly pushdown expression effects for XML stream processing. In: PlanX (2005)

    Google Scholar 

  26. Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of automata theory. J. Comput. Syst. Sci. 1, 317–322 (1967)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lille, Lille, France

    Iovka Boneva & Momar Sakho

  2. Inria Lille, Lille, France

    Joachim Niehren & Momar Sakho

Authors
  1. Iovka Boneva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joachim Niehren
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Momar Sakho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Momar Sakho .

Editor information

Editors and Affiliations

  1. University of Trier, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Boneva, I., Niehren, J., Sakho, M. (2020). Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. In: Fernau, H. (eds) Computer Science – Theory and Applications. CSR 2020. Lecture Notes in Computer Science(), vol 12159. Springer, Cham. https://doi.org/10.1007/978-3-030-50026-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-50026-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-50025-2

  • Online ISBN: 978-3-030-50026-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation