Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Foundations of XML processing : the tree-automata approach
Hosoya H., Cambridge University Press, New York, NY, 2010. 238 pp. Type: Book (978-0-521196-13-0)
Date Reviewed: Jul 1 2011

Extensible Markup Language (XML) is one of the core technologies currently used both for the Web and in data/document-related representations. In most cases, developers use the standard document object model (DOM) approach in their implementations to parse, create, and modify XML documents. This means that anyone who understands core DOM can write XML implementations.

Hosoya’s theoretical book goes far beyond the simple and easy-to-understand DOM approach. He actually wants to create the theoretical foundations for XML. This is a nontrivial undertaking since, in contrast to reading XML books, it requires a firm theoretical background in computer science.

The book consists of two main parts: “Basic Topics” and “Advanced Topics.”

The fact that Part 1 is referred to as “basic” does not mean that it is easy to read. After a very rudimentary XML introduction--readers should actually already know XML--the author begins to explain tree automata and pattern matching, which, in later chapters, he applies to XML schemas and type checking.

The advanced chapters cover algorithms dealing with various adaptations, modifications, and improvements of the presented topics. They also touch on XPath and “caterpillar expressions,” an alternative to XPath. One chapter covers logic-based queries to retrieve nodes from XML.

Who is the target audience for this book? It is definitely not XML developers who normally use DOM as their core implementation background. The book requires too much theoretical knowledge, and a practitioner would not gain much from a firm theoretical foundation. The book is obviously interesting to theoretical computer scientists, and to developers who may implement their own XML parsers and retrieval mechanisms (it provides hints for the underlying implementations). Instructors at a university may also use the book in an advanced course on XML. It contains several exercises, with solutions.

The book requires some work and reflection if you’re not a theoretical computer scientist who works daily with these types of themes.

Reviewer:  K. Waldhör Review #: CR139201 (1111-1132)
Bookmark and Share
 
Automata (F.1.1 ... )
 
 
Type Structure (F.3.3 ... )
 
 
XML (I.7.2 ... )
 
 
Studies Of Program Constructs (F.3.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Automata": Date
The congruence theory of closure properties of regular tree languages
Tirri S. Theoretical Computer Science 76(2-3): 261-271, 2001. Type: Article
Jun 1 1991
Distribution and synchronized automata
Petit A. Theoretical Computer Science 76(2-3): 285-308, 2001. Type: Article
Feb 1 1992
Efficient simulation of finite automata by neural nets
Alon N., Dewdney A., Ott T. Journal of the ACM 38(2): 495-514, 1991. Type: Article
Dec 1 1991
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy