Name
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 inference of 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.14778/2311906.2311914 | PVLDB |
Keywords | DocType | Volume |
type-based detection,challenging issue,resulting independence analysis,chain-based analysis,efficient implementation,xml query-update independence,polynomial space,novel static analysis technique,complete approximation technique,finite analysis,recursive schema | Journal | 5 |
Issue | ISSN | Citations |
9 | Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 9, pp.
872-883 (2012) | 1 |
PageRank | References | Authors |
0.35 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicole Bidoit-Tollu | 1 | 5 | 1.47 |
| Dario Colazzo | 2 | 283 | 34.21 |
| Federico Ulliana | 3 | 31 | 6.57 |