XML reasoning made practical

Author

Genevès, Pierre ; Layaïda, Nabil

Author_Institution

CNRS, Grenoble, France

fYear

2010

fDate

1-6 March 2010

Firstpage

1169

Lastpage

1172

Abstract

We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams) in order to efficiently solve XPath query satisfiability, containment, and equivalence, in the presence of real-world XML Schemas. The tool can be used in query optimizers, in order to prove soundness of query rewriting. It can also be used in type-checkers and optimizing compilers that need to perform all kinds of compile-time analyses involving XPath queries and XML tree constraints.

Keywords

XML; binary decision diagrams; formal verification; optimising compilers; query processing; XML reasoning; XML schemas; XML tree constraints; XPath queries; binary decision diagrams; compile-time analyses; optimizing compilers; query containment; query equivalence; query optimizers; query rewriting; query satisfiability; type-checkers; verification field; Boolean functions; Costs; Data structures; Independent component analysis; Java; Logic; Navigation; Optimizing compilers; Performance analysis; XML;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering (ICDE), 2010 IEEE 26th International Conference on

Conference_Location

Long Beach, CA

Print_ISBN

978-1-4244-5445-7

Electronic_ISBN

978-1-4244-5444-0

Type

conf

DOI

10.1109/ICDE.2010.5447786

Filename

5447786