Keyword(s):XML documents, tree algebra, integration framework

Related
Ontology
Subjects/Areas/Topics:Coupling and Integrating Heterogeneous Data Sources
;
Databases and Information Systems Integration
;
Enterprise Information Systems

Abstract: This paper introduces a framework in algebra for processing XML data. We develop a simple algebra, called TA (Tree Algebra), for processing storing and manipulating XML data, modelled as trees. We present assumptions of the framework, describe the input and the output of the algebraic operators, and define the syntax of these operators and their semantics in terms of algorithms. Furthermore we define the relational operators and their semantics in terms of algorithms. Examples show that this framework is flexible to capture queries expressed in the domain specific XML query language. As can be seen the input and output of our algebra is a tree that is the input and output are XML document and the XML documents are defined as trees. We also present algorithms for many of the algebra operators; these algorithms show how the algebra operators such as join, union, complement, project, select, expose and vertex work on nodes of the XML tree or element and attributes of an XML document. Detailed examples are given.(More)

This paper introduces a framework in algebra for processing XML data. We develop a simple algebra, called TA (Tree Algebra), for processing storing and manipulating XML data, modelled as trees. We present assumptions of the framework, describe the input and the output of the algebraic operators, and define the syntax of these operators and their semantics in terms of algorithms. Furthermore we define the relational operators and their semantics in terms of algorithms. Examples show that this framework is flexible to capture queries expressed in the domain specific XML query language. As can be seen the input and output of our algebra is a tree that is the input and output are XML document and the XML documents are defined as trees. We also present algorithms for many of the algebra operators; these algorithms show how the algebra operators such as join, union, complement, project, select, expose and vertex work on nodes of the XML tree or element and attributes of an XML document. Detailed examples are given.

*Limit of Downloads ExceededJoin SciTePress now to download more papers for free and get access to over
full text papers.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

El bekai A.; Rossiter N. and (2005). A TREE BASED ALGEBRA FRAMEWORK FOR XML DATA SYSTEMS.In Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 972-8865-19-8, pages 305-312. DOI: 10.5220/0002528403050312

@conference{iceis05, author={Ali {El bekai} and Nick Rossiter}, title={A TREE BASED ALGEBRA FRAMEWORK FOR XML DATA SYSTEMS}, booktitle={Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,}, year={2005}, pages={305-312}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0002528403050312}, isbn={972-8865-19-8}, }

TY - CONF

JO - Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS, TI - A TREE BASED ALGEBRA FRAMEWORK FOR XML DATA SYSTEMS SN - 972-8865-19-8 AU - El bekai, A. AU - Rossiter, N. PY - 2005 SP - 305 EP - 312 DO - 10.5220/0002528403050312