A Semi-Monad for Semi-Structured Data (2001)
Cached
Download Links
- [www-db.research.bell-labs.com]
- [homepages.inf.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Citations: | 41 - 3 self |
BibTeX
@MISC{Fernandez01asemi-monad,
author = {Mary Fernandez and Jérôme Siméon and Philip Wadler},
title = {A Semi-Monad for Semi-Structured Data},
year = {2001}
}
Years of Citing Articles
OpenURL
Abstract
. This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression types, similar in power to DTDs or XML Schemas, and closely related to Hasoya and Pierce's work on Xduce. The iteration construct is based on the notion of a monad, and involves novel typing rules not encountered elsewhere. 1 Introduction This document proposes an algebra for XML Query. This work builds on long standing traditions in the database community. In particular, we have been inspired by systems such as SQL, OQL, and nested relational algebra (NRA). We have also been inspired by systems such as Quilt, UnQL, XDuce, XML-QL, XPath, XQL, XSLT, and YATL. We give citations for all these systems below. In the database world, it is common to translate a query language into an algebra; this happens in SQL, OQL, and NRA, among others. The purpose of the algebra is twofold. First, the algebra is used to give...







