Theorem about amplification of relational algebra by recursive objects

Veronika V. Sokolova, Oxana M. Zamyatina

Результат исследований: Материалы для книги/типы отчетовМатериалы для конференции

Выдержка

This paper discusses relational algebra extended by recursive relations (tables). The interpretation of the recursive table is proposed, the closure of the extended relational algebra is proved, and a new approach to modeling a physical database structure is offered that is suitable for representing complicated hierarchical data sets. It combines methods of set theory for the recursive relations within the framework of a single modeling paradigm, which allows users to define self-similar, partially self-similar, or hierarchical sets. The use of recursive relations in the definitions of self-similar objects yields representations that can be rendered at varying levels of detail or precision at run time.

Язык оригиналаАнглийский
Название основной публикацииAdvances in Intelligent and Soft Computing
Страницы591-596
Число страниц6
Том123
DOI
СостояниеОпубликовано - 2011

Серия публикаций

НазваниеAdvances in Intelligent and Soft Computing
Том123
ISSN (печатное издание)18675662

Отпечаток

Algebra
Amplification
Set theory

ASJC Scopus subject areas

  • Computer Science(all)

Цитировать

Sokolova, V. V., & Zamyatina, O. M. (2011). Theorem about amplification of relational algebra by recursive objects. В Advances in Intelligent and Soft Computing (Том 123, стр. 591-596). (Advances in Intelligent and Soft Computing; Том 123). https://doi.org/10.1007/978-3-642-25661-5_72

Theorem about amplification of relational algebra by recursive objects. / Sokolova, Veronika V.; Zamyatina, Oxana M.

Advances in Intelligent and Soft Computing. Том 123 2011. стр. 591-596 (Advances in Intelligent and Soft Computing; Том 123).

Результат исследований: Материалы для книги/типы отчетовМатериалы для конференции

Sokolova, VV & Zamyatina, OM 2011, Theorem about amplification of relational algebra by recursive objects. в Advances in Intelligent and Soft Computing. том. 123, Advances in Intelligent and Soft Computing, том. 123, стр. 591-596. https://doi.org/10.1007/978-3-642-25661-5_72
Sokolova VV, Zamyatina OM. Theorem about amplification of relational algebra by recursive objects. В Advances in Intelligent and Soft Computing. Том 123. 2011. стр. 591-596. (Advances in Intelligent and Soft Computing). https://doi.org/10.1007/978-3-642-25661-5_72
Sokolova, Veronika V. ; Zamyatina, Oxana M. / Theorem about amplification of relational algebra by recursive objects. Advances in Intelligent and Soft Computing. Том 123 2011. стр. 591-596 (Advances in Intelligent and Soft Computing).
@inproceedings{afb95579b84f43cc9a891aa800b1d6c6,
title = "Theorem about amplification of relational algebra by recursive objects",
abstract = "This paper discusses relational algebra extended by recursive relations (tables). The interpretation of the recursive table is proposed, the closure of the extended relational algebra is proved, and a new approach to modeling a physical database structure is offered that is suitable for representing complicated hierarchical data sets. It combines methods of set theory for the recursive relations within the framework of a single modeling paradigm, which allows users to define self-similar, partially self-similar, or hierarchical sets. The use of recursive relations in the definitions of self-similar objects yields representations that can be rendered at varying levels of detail or precision at run time.",
keywords = "database, domain, recursive table, relational algebra, relational operations, tuple",
author = "Sokolova, {Veronika V.} and Zamyatina, {Oxana M.}",
year = "2011",
doi = "10.1007/978-3-642-25661-5_72",
language = "English",
isbn = "9783642256608",
volume = "123",
series = "Advances in Intelligent and Soft Computing",
pages = "591--596",
booktitle = "Advances in Intelligent and Soft Computing",

}

TY - GEN

T1 - Theorem about amplification of relational algebra by recursive objects

AU - Sokolova, Veronika V.

AU - Zamyatina, Oxana M.

PY - 2011

Y1 - 2011

N2 - This paper discusses relational algebra extended by recursive relations (tables). The interpretation of the recursive table is proposed, the closure of the extended relational algebra is proved, and a new approach to modeling a physical database structure is offered that is suitable for representing complicated hierarchical data sets. It combines methods of set theory for the recursive relations within the framework of a single modeling paradigm, which allows users to define self-similar, partially self-similar, or hierarchical sets. The use of recursive relations in the definitions of self-similar objects yields representations that can be rendered at varying levels of detail or precision at run time.

AB - This paper discusses relational algebra extended by recursive relations (tables). The interpretation of the recursive table is proposed, the closure of the extended relational algebra is proved, and a new approach to modeling a physical database structure is offered that is suitable for representing complicated hierarchical data sets. It combines methods of set theory for the recursive relations within the framework of a single modeling paradigm, which allows users to define self-similar, partially self-similar, or hierarchical sets. The use of recursive relations in the definitions of self-similar objects yields representations that can be rendered at varying levels of detail or precision at run time.

KW - database

KW - domain

KW - recursive table

KW - relational algebra

KW - relational operations

KW - tuple

UR - http://www.scopus.com/inward/record.url?scp=84555204272&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84555204272&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25661-5_72

DO - 10.1007/978-3-642-25661-5_72

M3 - Conference contribution

AN - SCOPUS:84555204272

SN - 9783642256608

VL - 123

T3 - Advances in Intelligent and Soft Computing

SP - 591

EP - 596

BT - Advances in Intelligent and Soft Computing

ER -