Foundations of XML Processing: The Tree-Automata ApproachCambridge University Press, 4 nov. 2010 - 226 pages This is the first book that provides a solid theoretical account of the foundation of the popular data format XML. Part I establishes basic concepts, starting with schemas, tree automata and pattern matching, and concluding with static typechecking for XML as a highlight of the book. In Part II, the author turns his attention to more advanced topics, including efficient 'on-the-fly' tree automata algorithms, path- and logic-based queries, tree transformation, and exact typechecking. The author provides many examples of code fragments to illustrate features, and exercises to enhance understanding. Thus the book will be ideal for students and researchers whether just beginning, or experienced in XML research. |
Table des matières
| 1 | |
2 Preliminaries | 9 |
I Basic topics | 17 |
II Advanced topics | 91 |
Appendix Solutions to selected exercises | 199 |
References | 218 |
| 223 | |
Autres éditions - Tout afficher
Expressions et termes fréquents
accepts algorithm allows alternating tree ambiguity appearing approach assigned attributes automata binary binding Chapter child combining compute condition conforms consider constraints construction contains corresponding defined definition described deterministic document element empty exact example Exercise extend final first Formally formula function gender give given holds Hosoya induction inference initial input introduce label language leaf linear logic mapping marking tree automaton match means multiset node nondeterministic Note obtain operations output pair path pattern person possible present procedure Proof prove regular expression relation representing restriction result return true root rule schema semantics sequence simple single spouse step string automaton structure subtree successful Theorem top-down tour transformation transition tree automaton tree transducers tree-walking typechecking unambiguous variable write yields