Commutativity analysis for XML updates

Ghelli, Giorgio; Rose, Kristoffer H.; Simèon, Jérǒme

doi:10.1145/1412331.1412341

Cited by 13 publications

(29 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[24,6,26,11,16,2,18, 27]) we employ a simplified XML data model and query language, focusing on tree structure and ignoring attributes and some other features. Generalizing to handle these features is straightforward.…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

Destabilizers and independence of XML updates

Benedikt

Cheney

2010

Proc. VLDB Endow.

View full text Add to dashboard Cite

Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework for static independence analysis that decomposes the problem into two orthogonal subproblems: approximating the destabilizer, that is, a finite representation of the set of updates that can change the result of the query, and testing whether the update and destabilizer overlap via an intersection analysis. Focusing on XML queries as the view language and the XQuery Update Facility as the update language, we present a syntactic query rewriting algorithm for translating queries to destabilizers, and show that intersection checking can be reduced to satisfiability problems for which efficient checkers already exist. We present an implementation based on an expressive tree satisfiability checker and a Satisfiability Modulo Order package, and give experiments confirming that the resulting analysis is both fast and effective.

show abstract

Section: Preliminariesmentioning

confidence: 99%

“…Destabilizers are a generalization of ideas such as statically approximating the set of accessed nodes found in some prior work [24,6,18]. However, the destabilizer framework provides increased flexibility and modularity, easing exploration of the tradeoff between precision and performance.…”

Section: Introductionmentioning

confidence: 99%

Destabilizers and independence of XML updates

Benedikt

Cheney

2010

Proc. VLDB Endow.

View full text Add to dashboard Cite

show abstract

“…Therefore, independence of Q and U is inferred. Note here that both methods introduced by [16] and [40] fail to detect independence for this example.…”

Section: Type-based Methods For Testing Xml Query-update Independencementioning

confidence: 87%

“…A path-based approach has been proposed in [40] in order to check commutativity of update expressions which is of crucial importance for optimization and view maintenance. This technique, which does not use schema information, can be adapted to deal with queries: two sets of paths are extracted resp.…”

Section: Type-based Methods For Testing Xml Query-update Independencementioning

confidence: 99%

Types and Constraints: From Relational to XML Data

Bidoit-Tollu

2011

Semantics in Data and Knowledge Bases

View full text Add to dashboard Cite

Abstract. The goal of this article is to show that, in the context of XML data processing, information conveyed by schema or XML types is a powerful component to deploy optimization methods. We focus on the one hand on recent work developed for optimizing query and update evaluation for main-memory engines and on the other hand on techniques for checking XML query-update independence. These methods are all based on static type analysis. The aim of the article is to show how types rank before constraints for XML data processing and the presentation of each method is kept informal.

show abstract

“…As noticed in [2], prior techniques either required a schema [1,4] or apply only to downward fragments of XPath. [13] proposes a conservative analysis for an XML update language and a theorem that can be used to identify commuting expressions. However a different update language proposal is considered and independence is not addressed.…”

Section: Related Workmentioning

confidence: 99%

XML query-update independence analysis revisited

Junedi

Genevès

Layaïda

2012

Proceedings of the 2012 ACM Symposium on Document Engineering

View full text Add to dashboard Cite

XML transformations can be resource-costly in particular when applied to very large XML documents and document sets. Those transformations usually involve lots of XPath queries and may not need to be entirely re-executed following an update of the input document. In this context, a given query is said to be independent of a given update if, for any XML document, the results of the query are not affected by the update. We revisit Benedikt and Cheney's framework for query-update independence analysis and show that performance can be drastically enhanced, contradicting their initial claims. The essence of our approach and results resides in the use of an appropriate logic, to which queries and updates are both succinctly translated. Compared to previous approaches, ours is more expressive from a theoretical point of view, equally accurate, and more efficient in practice. We illustrate this through practical experiments and comparative figures.

show abstract

Commutativity analysis for XML updates

Cited by 13 publications

References 11 publications

Destabilizers and independence of XML updates

Destabilizers and independence of XML updates

Types and Constraints: From Relational to XML Data

XML query-update independence analysis revisited

Contact Info

Product

Resources

About