<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The existing cloud data models cannot meet the management requirements of structured data very well including a great deal of relational data, therefore a two-layer cloud data model is proposed. The composite object is defined to model the nested data in the representation layer, while a 4-tuple is defined to model the non-nested data in the storage layer. Referring the relational algebra, the concept of SNO (Simple Nested Object) is defined as basic operational unit of the algebraic operations; the formal definitions of the algebraic operations consisting of the set operations and the query operations on the representation layer are proposed. The algorithm of extracting all SNOs from a CAO (Component-Attribute-Object) set of a composite object is proposed firstly as the foundation, and then as the idea; the pseudo code implementation of algorithms of the algebraic operations on the storage layer are proposed. Logic proof and example proof indicate that the definition and the algorithms of the algebraic operations are correct.</p></abstract>

The existing cloud data models cannot meet the management requirements of structured data very well including a great deal of relational data, therefore a two-layer cloud data model is proposed. The composite object is defined to model the nested data in the representation layer, while a 4-tuple is defined to model the non-nested data in the storage layer. Referring the relational algebra, the concept of SNO (Simple Nested Object) is defined as basic operational unit of the algebraic operations; the formal definitions of the algebraic operations consisting of the set operations and the query operations on the representation layer are proposed. The algorithm of extracting all SNOs from a CAO (Component-Attribute-Object) set of a composite object is proposed firstly as the foundation, and then as the idea; the pseudo code implementation of algorithms of the algebraic operations on the storage layer are proposed. Logic proof and example proof indicate that the definition and the algorithms of the algebraic operations are correct.

The Algebraic Operations and Their Implementation Based on a Two-Layer Cloud Data Model

Guangxi Colleges and Universities Key Laboratory of Scientific Computing & Intelligent Information Processing, Guangxi Teachers Education University, Nanning 530001,

School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044,

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The existing cloud data models cannot meet the management requirements of structured data very well including a great deal of relational data, therefore a...

The Algebraic Operations and Their Implementation Based on a Two-Layer Cloud Data Model

Publicado en línea: 25 ene 2017

Páginas: 5 - 26

DOI: https://doi.org/10.1515/cait-2016-0074

Palabras clave
Cloud database, data model, algebraic operation, key-value, structured data

© 2016 Ying Li et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

The Algebraic Operations and Their Implementation Based on a Two-Layer Cloud Data Model

Publicado en línea: 25 ene 2017

Páginas: 5 - 26

DOI: https://doi.org/10.1515/cait-2016-0074

Palabras claveCloud database, data model, algebraic operation, key-value, structured data

© 2016 Ying Li et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Palabras clave
Cloud database, data model, algebraic operation, key-value, structured data