Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2015: Fundamentals of Computation Theory pp 327–338Cite as

Conjunctive Visibly-Pushdown Path Queries

  • Conference paper
  • First Online:

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

Abstract

We investigate an extension of conjunctive regular path queries in which path properties and path relations are defined by visibly pushdown automata. We study the problem of query evaluation for extended conjunctive visibly pushdown path queries and their subclasses, and give a complete picture of their combined and data complexity. In particular, we introduce a weaker notion called extended conjunctive reachability queries for which query evaluation has a polynomial data complexity. We also show that query containment is decidable in 2-EXPTIME for (non-extended) conjunctive visibly pushdown path queries.

The European Research Council has provided financial support under the European Community’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement no 259267.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the STOC 2004, pp. 202–211. ACM (2004)

    Google Scholar 

  2. Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1–39 (2008)

    Article  Google Scholar 

  3. Barceló, P., Figueira, D., Libkin, L.: Graph logics with rational relations. Logical Methods Comput. Sci. 9(3:1), 1–44 (2013)

    Google Scholar 

  4. Barceló, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37(4), 31 (2012)

    Article  Google Scholar 

  5. Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proceedings of the KR 2000, pp. 176–185. Morgan Kaufmann (2000)

    Google Scholar 

  6. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational databases. In: Proceedings of the STOC 1977, pp. 77–90 (1977)

    Google Scholar 

  7. Deutsch, A., Tannen, V.: Optimization properties for classes of conjunctive regular path queries. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, pp. 21–39. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Florescu, D., Levy, A.Y., Suciu, D.: Query containment for conjunctive queries with regular expressions. In: Proceedings of the PODS1998, pp. 139–148 (1998)

    Google Scholar 

  9. Freydenberger, D., Schweikardt, N.: Expressiveness and static analysis of extended conjunctive regular path queries. J. Comp. Syst. Sci. 79(6), 892–909 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hellings, J.: Conjunctive context-free path queries. In: Proceedings of the 17th International Conference on Database Theory (ICDT), pp. 119–130. Athens, Greece, 24–28 March 2014

    Google Scholar 

  11. Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Proceedings of the PODS 1998, pp. 205–213. ACM (1998)

    Google Scholar 

  12. Ladner, R.E.: The circuit value problem is log-space complete for \(P\). SIGACT News 6(2), 18–20 (1975)

    Article  MathSciNet  Google Scholar 

  13. Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: Proceedings of the ICALP 1980, vol. 85 of LNCS, pp. 422–435. Springer (1980)

    Google Scholar 

  14. Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: Proceedings of the VLDB 1989, pp. 185–193. Morgan Kaufmann (1989)

    Google Scholar 

  15. Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput. 19(3), 424–437 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We would like to thank Nicole Schweikardt for introducing the world of conjunctive path queries to us and for some interesting discussions on that topic.

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, University of Kassel, Kassel, Germany

    Martin Lange

  2. LSV, ENS Cachan and CNRS, Cachan, France

    Etienne Lozes

Authors
  1. Martin Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Etienne Lozes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Lange .

Editor information

Editors and Affiliations

  1. Université Paris Diderot, Paris, France

    Adrian Kosowski

  2. Université Bordeaux 1, Talence, France

    Igor Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lange, M., Lozes, E. (2015). Conjunctive Visibly-Pushdown Path Queries. In: Kosowski, A., Walukiewicz, I. (eds) Fundamentals of Computation Theory. FCT 2015. Lecture Notes in Computer Science(), vol 9210. Springer, Cham. https://doi.org/10.1007/978-3-319-22177-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22177-9_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22176-2

  • Online ISBN: 978-3-319-22177-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation