Type-Based Detection of XML Query-Update Independence
Nicole Bidoit-Tollu, Dario Colazzo, Federico Ulliana

TL;DR
This paper introduces a new static analysis method for detecting XML query-update independence using type chains, providing a precise, efficient, and sound approach even with recursive schemas.
Contribution
It proposes a novel chain-based analysis technique that infers type chains for XML documents, handling recursive schemas with a sound approximation.
Findings
Efficient polynomial-space and time implementation
Sound and complete approximation for recursive schemas
Precise detection of query-update independence
Abstract
This paper presents a novel static analysis technique to detect XML query-update independence, in the presence of a schema. Rather than types, our system infers chains of types. Each chain represents a path that can be traversed on a valid document during query/update evaluation. The resulting independence analysis is precise, although it raises a challenging issue: recursive schemas may lead to infer infinitely many chains. A sound and complete approximation technique ensuring a finite analysis in any case is presented, together with an efficient implementation performing the chain-based analysis in polynomial space and time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Semantic Web and Ontologies · Data Management and Algorithms
