Algebraic semantics of XML schema

Authors:
Leonid Novak;Alexandre Zamulin
Affiliations:
Institute of System Programming, Russian Academy of Sciences, Moscow, Russia;A.P. Ershov Institute of Informatics Systems, Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia
Venue:
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Year:
2005

Citing 6
Cited 1

MSL — a model for W3C XML schema

Proceedings of the 10th international conference on World Wide Web
The essence of XML

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Object-Oriented Database as a Dynamic System with Implicit State

ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
An Algebra for XML Query

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
TAX: A Tree Algebra for XML

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Canonical Forms of XML Schemas

Programming and Computing Software

An XML algebra for XQuery

ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The semantics of the core features of XML Schema in terms of the XQuery 1.0 and XPath 2.0 data model algebraically defined is given. The database state is represented as a many-sorted algebra whose sorts are sets of data type values and different kinds of nodes and whose operations are data type operations and node accessors. It is shown that a document can be easily mapped to its implementation in terms of nodes and accessors defined on them.