A Prototype of a Schema-Based XPath Satisfiability Tester

  • Jinghua Groppe
  • Sven Groppe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4080)


The satisfiability test of queries can be used in query optimization for avoiding submission and computation of unsatisfiable queries. Thus, applying the satisfiability test before executing a query can save evaluation time and transportation costs in distributed scenarios. Therefore, we propose a schema-based approach to the satisfiability test of XPath queries, which checks whether or not an XPath query conforms to the constraints in a given schema. If an XPath query does not conform to the constraints given in the schema, the evaluation of the query will return an empty result for every XML document. Thus, the XPath query is unsatisfiable. We present a complexity analysis of our approach, which proves that our approach is efficient at typical cases. We present an experimental analysis of our developed prototype, which shows the optimization potential of avoiding the evaluation of unsatisfiable queries.


Denotational Semantic XPath Query XPath Expression Predicate Expression Location Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Benedikt, M., Fan, W., Geerts, F.: XPath Satisfiability in the presence of DTDs. In: PODS 2005 (2005)Google Scholar
  2. 2.
    Franceschet, M.: XPathMark – An XPath benchmark for XMark. Research report PP-2005-04, University of Amsterdam, the Netherlands (2005)Google Scholar
  3. 3.
    Groppe, S.: XML Query Reformulation for XPath, XSLT and XQuery. Sierke-Verlag, Göttingen (2005)Google Scholar
  4. 4.
    Groppe, J., Groppe, S.: Filtering Unsatisfiabile XPath Queries. In: ICEIS 2006, Paphos-Cyprus (2006)Google Scholar
  5. 5.
    Groppe, S., Böttcher, S., Groppe, J.: XPath Query Simplification with regard to the Elimination of Intersect and Except Operators. In: XSDM 2006 in association with ICDE 2006 (2006)Google Scholar
  6. 6.
    Hidders, J.: Satisfiability of xPath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 21–36. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Kwong, A., Gertz, M.: Schema-based optimization of XPath expressions. Techn. Report University of California (2002)Google Scholar
  8. 8.
    Lakshmanan, L., Ramesh, G., Wang, H., Zhao, Z.: On Testing Satisfiability of Tree Pattern Queries. In: VLDB 2004 (2004)Google Scholar
  9. 9.
    Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking forward. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002, vol. 2490, pp. 109–127. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Schmidt, D.A.: The structure of Typed programming languages. MIT Press, Cambridge (1994)MATHGoogle Scholar
  11. 11.
    Wadler, P.: Two semantics for XPath. Tech. Report (2000)Google Scholar
  12. 12.
    W3C: XML Schema Part 1: Structures Second Edition. W3C Recommendation (2004),
  13. 13.
    W3C: XPath Version 1.0, W3C Recommendation (1999),
  14. 14.
    W3C: XPath Version 2.0, W3C Working Draft (2003),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jinghua Groppe
    • 1
  • Sven Groppe
    • 1
  1. 1.University of InnsbruckInnsbruckAustria

Personalised recommendations