Type-based detection of XML query-update independence

PVLDB(2012)

引用 12|浏览6
暂无评分
摘要
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.
更多
查看译文
关键词
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
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要