A Logic-Based Approach to Cache Answerability for XPath Queries

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.

[1]  Maarten Marx,et al.  Conditional XPath, the first order complete XPath dialect , 2004, PODS.

[2]  Georg Gottlob,et al.  The complexity of XPath query evaluation , 2003, PODS.

[3]  Philip S. Yu,et al.  ViST: a dynamic index method for querying XML data by tree structures , 2003, SIGMOD '03.

[4]  Thomas Schwentick,et al.  Query automata over finite trees , 2002, Theor. Comput. Sci..

[5]  Loredana Afanasiev,et al.  XCheck: a platform for benchmarking XQuery engines , 2006, VLDB.

[6]  Torsten. Grust,et al.  Accelerating XPath location steps , 2002, SIGMOD '02.

[7]  Georg Gottlob,et al.  Efficient Algorithms for Processing XPath Queries , 2002, VLDB.

[8]  Bongki Moon,et al.  PRIX: indexing and querying XML using prufer sequences , 2004, Proceedings. 20th International Conference on Data Engineering.

[9]  Scott Boag,et al.  XQuery 1.0 : An XML Query Language , 2007 .

[10]  Jignesh M. Patel,et al.  Structural joins: a primitive for efficient XML query pattern matching , 2002, Proceedings 18th International Conference on Data Engineering.

[11]  Nan Wang,et al.  Automatic composite wrapper generation for semi-structured biological data based on table structure identification , 2004, SGMD.

[12]  Massimo Franceschet,et al.  Modal logic and navigational XPath: an experimental comparison , 2005 .

[13]  Georg Gottlob,et al.  XPath query evaluation: improving time and space efficiency , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[14]  Ioana Manolescu,et al.  MemBeR: A Micro-benchmark Repository for XQuery , 2005, XSym.

[15]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

[16]  Mong-Li Lee,et al.  Efficient Mining of XML Query Patterns for Caching , 2003, VLDB.

[17]  Mong-Li Lee,et al.  An evaluation of XML indexes for structural join , 2004, SGMD.

[18]  M. de Rijke,et al.  CTL model checking for processing simple XPath queries , 2004, Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004..

[19]  Massimo Franceschet.  XPathMark: An XPath Benchmark for the XMark Generated Data , 2005, XSym.

[20]  Ioana Manolescu,et al.  XMark: A Benchmark for XML Data Management , 2002, VLDB.

[21]  Steven J. DeRose,et al.  XML Path Language (XPath) Version 1.0 , 1999 .

[22]  Christoph Koch,et al.  Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach , 2003, VLDB.

[23]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[24]  Pieter H. Hartel,et al.  A trace semantics for positive core XPath , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[25]  Dan Suciu,et al.  Database and XML Technologies , 2004, Lecture Notes in Computer Science.

[26]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[27]  Vassilis J. Tsotras,et al.  Tree-Pattern Queries on a Lightweight XML Processor , 2005, VLDB.

[28]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[29]  Frank Neven,et al.  Automata theory for XML researchers , 2002, SGMD.