XML: model, schemas, types, logics, and queries (2003)
| Venue: | IN LOGICS FOR EMERGING APPLICATIONS OF DATABASES |
| Citations: | 13 - 0 self |
BibTeX
@INPROCEEDINGS{Klarlund03xml:model,,
author = {Nils Klarlund and Thomas Schwentick and Dan Suciu},
title = {XML: model, schemas, types, logics, and queries},
booktitle = {IN LOGICS FOR EMERGING APPLICATIONS OF DATABASES},
year = {2003},
pages = {1--41},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
... In this chapter, we shall see that the suspicion is easy dispelled. We look at techniques now used in practice for dealing with XML trees, and we note how they depart from old-fashioned uses. Since trees are objects that are very complicated to manipulate directly through pointer updates, declarative techniques are becoming increasingly important, especially when it comes to exploring, mining, and constructing tree-shaped data. In particular, we will contrast conventional concepts of database theory such as relational calculus with that of more procedural notations for trees. We explore why the essential problem of locating data in trees is intimately linked with tree automata and decidable logics, somewhat in parallel to the link between query algebras and first-order logic in relational database theory. So, we shall see why logic and automata create interesting new research opportunities.
