Foundations of XML Processing : The Tree-Automata Approach
Saved in:
| Title: | Foundations of XML Processing : The Tree-Automata Approach |
|---|---|
| Description: | 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. |
| Authors: | Haruo Hosoya |
| Resource Type: | eBook. |
| Subjects: | Machine theory, XML (Document markup language) |
| Categories: | COMPUTERS / Languages / HTML, COMPUTERS / Languages / XML |
| Database: | eBook Collection (EBSCOhost) |
| FullText | Links: – Type: ebook-pdf Text: Availability: 0 |
|---|---|
| Header | DbId: nlebk DbLabel: eBook Collection (EBSCOhost) An: 335206 RelevancyScore: 1038 AccessLevel: 6 PubType: eBook PubTypeId: ebook PreciseRelevancyScore: 1037.72192382813 |
| IllustrationInfo | |
| ImageInfo | – Size: thumb Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$335206$PDF&s=r – Size: medium Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$335206$PDF&s=d |
| Items | – Name: Title Label: Title Group: Ti Data: Foundations of XML Processing : The Tree-Automata Approach – Name: Abstract Label: Description Group: Ab Data: 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. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Haruo+Hosoya%22">Haruo Hosoya</searchLink> – Name: TypePub Label: Resource Type Group: TypPub Data: eBook. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22XML+%28Document+markup+language%29%22">XML (Document markup language)</searchLink> – Name: SubjectBISAC Label: Categories Group: Su Data: <searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Languages+%2F+HTML%22">COMPUTERS / Languages / HTML</searchLink><br /><searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Languages+%2F+XML%22">COMPUTERS / Languages / XML</searchLink> |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=335206 |
| RecordInfo | BibRecord: BibEntity: Classifications: – Code: 006.74 Scheme: ddc Type: prePub Languages: – Code: eng Text: English Subjects: – SubjectFull: Machine theory Type: general – SubjectFull: XML (Document markup language) Type: general Titles: – TitleFull: Foundations of XML Processing : The Tree-Automata Approach Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Haruo Hosoya – PersonEntity: Name: NameFull: Haruo Hosoya IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2011 – D: 04 M: 02 Type: profile Y: 2014 Identifiers: – Type: isbn-print Value: 9780521196130 – Type: isbn-electronic Value: 9780511909566 Titles: – TitleFull: Foundations of XML Processing : The Tree-Automata Approach Type: main |
| ResultId | 1 |