An Algebra for XML Query

Mary F. Fernández, Jérôme Siméon, Philip Wadler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This document proposes an algebra for XML Query. The algebra has been submitted to the W3CXM L 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, Pierce, and Vouillon’s work on Xduce. The iteration construct involves novel typing rules not encountered elsewhere (even in Xduce).
Original languageEnglish
Title of host publicationFoundations of Software Technology and Theoretical Computer Science
Subtitle of host publication20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings.
PublisherSpringer Berlin Heidelberg
Pages11-45
Number of pages35
ISBN (Electronic)978-3-540-44450-3
ISBN (Print)978-3-540-41413-1
DOIs
Publication statusPublished - 2000

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume1974
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'An Algebra for XML Query'. Together they form a unique fingerprint.

Cite this