Skip to main content
SpringerLink
Log in

Satisfiability of Simple XPath Fragments under Fixed DTDs

  • Conference paper
Advances in Databases (BNCOD 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7051))

Included in the following conference series:

  • 594 Accesses

Abstract

The XPath satisfiability problem is to decide, for an XPath expression q and a DTD D, if there exists an XML document t valid against D such that the answer of q on t is nonempty. It is shown that the satisfiability problem is intractable for many XPath fragments. In this paper, we focus on fixed DTDs and consider the problem under fixed DTDs. We first show that, for a very restricted XPath fragment, the satisfiability problem is NP-complete under fixed DTDs. Then we show several XPath fragments for which satisfiability is in PTIME under fixed DTDs.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benedikt, M., Fan, W., Geerts, F.: Xpath satisfiability in the presence of dtds. Journal of the ACM 55(2) (2008)

    Google Scholar 

  2. Brüggenmann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Figueira, D.: Satisfiability of downward xpath with data equality tests. In: Proc. PODS, pp. 197–206 (2009)

    Google Scholar 

  4. Geerts, F., Fan, W.: Satisfiability of xpath queries with sibling axes. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 122–137. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Hidders, J.: Satisfiability of xpath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 21–36. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Ishihara, Y., Shimizu, S., Fujiwara, T.: Extending the tractability results on xpath satisfiability with sibling axes. In: Lee, M.L., Yu, J.X., Bellahsène, Z., Unland, R. (eds.) XSym 2010. LNCS, vol. 6309, pp. 33–47. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Lakshmanan, L.V.S., Ramesh, G., Wang, H., Zhao, Z.J.: On testing satisfiability of tree pattern queries. In: Proc. VLDB, pp. 120–131 (2004)

    Google Scholar 

  8. Montazerian, M., Wood, P.T., Mousavi, S.R.: Xpath query satisfiability is in ptime for real-world dtds. In: Barbosa, D., Bonifati, A., Bellahsène, Z., Hunt, E., Unland, R. (eds.) XSym 2007. LNCS, vol. 4704, pp. 17–30. Springer, Heidelberg (2007)

    Google Scholar 

  9. Suzuki, N.: An algorithm for inferring k optimum transformations of xml document from update script to dtd. IEICE Trans. Inf. & Syst. E93-D(8), 2198–2212 (2010)

    Article  Google Scholar 

  10. Suzuki, N., Fukushima, Y.: Satisfiability of simple xpath fragments in the presence of dtds. In: Proc. WIDM, pp. 15–22 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Tsukuba, 1-2, Kasuga, Tsukuba, Ibaraki, 305-8550, Japan

    Nobutaka Suzuki

Authors
  1. Nobutaka Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Manchester, M13 9PL, Manchester, UK

    Alvaro A. A. Fernandes , Alasdair J. G. Gray  & Khalid Belhajjame ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suzuki, N. (2011). Satisfiability of Simple XPath Fragments under Fixed DTDs. In: Fernandes, A.A.A., Gray, A.J.G., Belhajjame, K. (eds) Advances in Databases. BNCOD 2011. Lecture Notes in Computer Science, vol 7051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24577-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24577-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24576-3

  • Online ISBN: 978-3-642-24577-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation