Theorem about Amplification of Relational Algebra by Recursive Objects
| Parent link: | Knowledge Engineering and Management: Scientific Journal Vol. 123.— 2011.— [P. 591-596] |
|---|---|
| מחבר ראשי: | |
| מחברים אחרים: | |
| סיכום: | Title screen 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 Режим доступа: по договору с организацией-держателем ресурса |
| יצא לאור: |
2011
|
| נושאים: | |
| גישה מקוונת: | http://link.springer.com/chapter/10.1007/978-3-642-25661-5_72 |
| פורמט: | אלקטרוני Book Chapter |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=636418 |