A logic-based approach to cache answerability for XPath queries

Authors:
M. Franceschet;E. Zimuel
Affiliations:
Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands;Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands
Venue:
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Year:
2006

Citing 22
Cited 0

Model checking

Model checking
Modal logic

Modal logic
Accelerating XPath location steps

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Query automata over finite trees

Theoretical Computer Science
Automata theory for XML researchers

ACM SIGMOD Record
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
PRIX: Indexing And Querying XML Using Prüfer Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
CTL Model Checking for Processing Simple XPath Queries

TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
An evaluation of XML indexes for structural join

ACM SIGMOD Record
Conditional XPath, the first order complete XPath dialect

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Trace Semantics for Positive Core XPath

TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Efficient algorithms for processing XPath queries

ACM Transactions on Database Systems (TODS)
Tree-pattern queries on a lightweight XML processor

VLDB '05 Proceedings of the 31st international conference on Very large data bases
XCheck: a platform for benchmarking XQuery engines

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient mining of XML query patterns for caching

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient processing of expressive node-selecting queries on XML data in secondary storage: a tree automata-based approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
XPathMark: an XPath benchmark for the XMark generated data

XSym'05 Proceedings of the Third international conference on Database and XML Technologies
MemBeR: a micro-benchmark repository for XQuery

XSym'05 Proceedings of the Third international conference on Database and XML Technologies

Quantified Score

Hi-index	0.00

Visualization

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.