Foundations of XML Processing
The Tree-Automata Approach
Seiten
2010
Cambridge University Press (Verlag)
978-0-521-19613-0 (ISBN)
Cambridge University Press (Verlag)
978-0-521-19613-0 (ISBN)
This is the first book to provide a solid theoretical account of the foundation of the popular data format XML. Exercises and examples of code fragments are included throughout to enhance understanding. This book is ideal for both students and researchers.
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.
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.
Haruo Hosoya is Assistant Professor in the Department of Computer Science at the University of Tokyo.
Preface; 1. Introduction; 2. Preliminaries; 3. Schemas; 4. Tree automata; 5. Pattern matching; 6. Marking tree automata; 7. Typechecking; 8. On-the-fly algorithms; 9. Alternating tree automata; 10. Tree transducers; 11. Exact typechecking; 12. Path expressions and tree-walking automata; 13. Logic-based queries; 14. Ambiguity; 15. Unorderedness; References; Index.
| Erscheint lt. Verlag | 4.11.2010 |
|---|---|
| Zusatzinfo | Worked examples or Exercises; 3 Halftones, black and white; 7 Line drawings, black and white |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 179 x 254 mm |
| Gewicht | 620 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Mathematik / Informatik ► Informatik ► Web / Internet | |
| ISBN-10 | 0-521-19613-2 / 0521196132 |
| ISBN-13 | 978-0-521-19613-0 / 9780521196130 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Lehmanns Media (Verlag)
CHF 55,95
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
