Skip to main content
SpringerLink
Log in
Book cover

International XML Database Symposium

XSym 2006: Database and XML Technologies pp 46–60Cite as

A Logic-Based Approach to Cache Answerability for XPath Queries

  • Conference paper

  • 291 Accesses

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

Abstract

We extend a recently proposed model checking-based algorithm for the evaluation of XPath queries with a cache strategy to store the results of the (most frequently) asked queries and to re-use them at occurrence. We experimentally show that, as soon as the cache is warm, the proposed optimization is quite effective. We complement our proposal with a broad experimental comparison of different strategies for XPath query processing.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. World Wide Web Consortium: XML Path Language (XPath) Version 1.0 (1999), http://www.w3.org/TR/xpath

  2. World Wide Web Consortium: XML Path Language (XPath) Version 2.0 (2005), http://www.w3.org/TR/xpath20

  3. World Wide Web Consortium: XQuery 1.0: An XML Query Language (2005), http://www.w3.org/TR/xquery

  4. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB, pp. 95–106 (2002)

    Google Scholar 

  5. Gottlob, G., Koch, C., Pichler, R.: XPath query evaluation: Improving time and space efficiency. In: ICDE, pp. 379–390 (2003)

    Google Scholar 

  6. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems 30, 444–491 (2005)

    Article  Google Scholar 

  7. Afanasiev, L., Franceschet, M., de Rijke, M., Marx, M.: CTL model checking for processing simple XPath queries. In: TIME, pp. 117–124 (2004)

    Google Scholar 

  8. Hartel, P.: A trace semantics for positive Core XPath. In: TIME, pp. 103–112 (2005)

    Google Scholar 

  9. Franceschet, M., Zimuel, E.: Modal logic and navigational XPath: an experimental comparison. In: M4M, pp. 156–172 (2005)

    Google Scholar 

  10. Neven, F.: Automata theory for XML researchers. SIGMOD Record 31, 39–46 (2002)

    Article  Google Scholar 

  11. Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science 275, 633–674 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Koch, C.: Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In: VLDB, pp. 249–260 (2003)

    Google Scholar 

  13. Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural joins: A primitive for efficient XML query pattern matching. In: ICDE, pp. 141–152 (2002)

    Google Scholar 

  14. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD Conference, pp. 310–321 (2002)

    Google Scholar 

  15. Grust, T.: Accelerating XPath location steps. In: SIGMOD Conference, pp. 109–120 (2002)

    Google Scholar 

  16. Fan, W., Park, S., Wang, H., Yu, P.S.: ViST: A dynamic index method for querying XML data by tree structures. In: SIGMOD Conference, pp. 110–121 (2003)

    Google Scholar 

  17. Moon, B., Rao, P.: PRIX: Indexing and querying XML using Prüfer sequences. In: ICDE, pp. 288–300 (2004)

    Google Scholar 

  18. Moro, M.M., Tsotras, V.J., Vagena, Z.: Tree-pattern queries on a lightweight XML processor. In: VLDB, pp. 205–216 (2005)

    Google Scholar 

  19. Chen, C., Hsu, W., Li, H., Lee, M.L.: An evaluation of XML indexes for structural join. SIGMOD Record 33, 28–33 (2004)

    Article  Google Scholar 

  20. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)

    Google Scholar 

  21. Marx, M.: Conditional XPath, the first order complete XPath dialect. In: PODS, pp. 13–22 (2004)

    Google Scholar 

  22. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  23. Hsu, W., Lee, M.L., Yang, L.H.: Efficient mining of XML query patterns for caching. In: VLDB, pp. 69–80 (2003)

    Google Scholar 

  24. Afanasiev, L., Franceschet, M., Marx, M., Zimuel, E.: XCheck: A platform for benchmarking XQuery engines (demonstration). In: VLDB (2006), http://ilps.science.uva.nl/Resources/XCheck

  25. Hooker, J.N.: Testing heuristics: We have it all wrong. Journal of Heuristics 1, 33–42 (1996)

    Article  Google Scholar 

  26. Afanasiev, L., Manolescu, I., Michiels, P.: MemBeR: a micro-benchmark repository for XQuery. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol. 3671, pp. 144–161. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  27. Franceschet, M.: XPathMark: an XPath benchmark for XMark generated data. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol. 3671, pp. 129–143. Springer, Heidelberg (2005), http://www.science.uva.nl/~francesc/xpathmark

    Chapter  Google Scholar 

  28. Schmidt, A., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: A benchmark for XML data management. In: VLDB, pp. 974–985 (2002), http://www.xml-benchmark.org

Download references

Author information

Authors and Affiliations

  1. Informatics Institute, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    M. Franceschet & E. Zimuel

  2. Dipartimento di Scienze, Università “Gabriele D’Annunzio”, Viale Pindaro, 42, 65127, Pescara, Italy

    M. Franceschet & E. Zimuel

Authors
  1. M. Franceschet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Zimuel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs–Research, P.O. Box, 07932, Florham Park, NJ, USA

    Sihem Amer-Yahia

  2. LIRMM - UMR 5506 CNRS / Université Montpellier 2, 161 Rue Ada, P.O. Box, F-34392, Montpellier Cedex 5,  

    Zohra Bellahsène

  3. Department of Computer Science, ETH Zurich, Switzerland

    Ela Hunt

  4. Universität Duisburg-Essen,  

    Rainer Unland

  5. Chinese University of Hong Kong, Hong Kong, China

    Jeffrey Xu Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Franceschet, M., Zimuel, E. (2006). A Logic-Based Approach to Cache Answerability for XPath Queries. In: Amer-Yahia, S., Bellahsène, Z., Hunt, E., Unland, R., Yu, J.X. (eds) Database and XML Technologies. XSym 2006. Lecture Notes in Computer Science, vol 4156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841920_4

Download citation

  • DOI: https://doi.org/10.1007/11841920_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38877-7

  • Online ISBN: 978-3-540-38879-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation