Theorem about Amplification of Relational Algebra by Recursive Objects
| Parent link: | Knowledge Engineering and Management: Scientific Journal Vol. 123.— 2011.— [P. 591-596] |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Zusammenfassung: | 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 Режим доступа: по договору с организацией-держателем ресурса |
| Sprache: | Englisch |
| Veröffentlicht: |
2011
|
| Schlagworte: | |
| Online-Zugang: | http://link.springer.com/chapter/10.1007/978-3-642-25661-5_72 |
| Format: | Elektronisch Buchkapitel |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=636418 |
MARC
| LEADER | 00000nla0a2200000 4500 | ||
|---|---|---|---|
| 001 | 636418 | ||
| 005 | 20250327100343.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\384 | ||
| 035 | |a RU\TPU\network\358 | ||
| 090 | |a 636418 | ||
| 100 | |a 20140115d2011 k||y0rusy50 ba | ||
| 101 | 0 | |a eng | |
| 102 | |a US | ||
| 135 | |a drnn ---uucaa | ||
| 181 | 0 | |a i | |
| 182 | 0 | |a b | |
| 200 | 1 | |a Theorem about Amplification of Relational Algebra by Recursive Objects |f V. V. Sokolova, O. M. Zamyatina | |
| 203 | |a Text |c electronic | ||
| 300 | |a Title screen | ||
| 320 | |a [References: p. 596 (6 tit.)] | ||
| 330 | |a 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 | ||
| 333 | |a Режим доступа: по договору с организацией-держателем ресурса | ||
| 461 | |t Knowledge Engineering and Management |o Scientific Journal | ||
| 463 | |t Vol. 123 |v [P. 591-596] |d 2011 | ||
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a труды учёных ТПУ | |
| 700 | 1 | |a Sokolova |b V. V. |c Specialist in the field of informatics and computer technology |c Associate Professor of Tomsk Polytechnic University, Candidate of technical science |f 1977- |g Veronika Valerievna |3 (RuTPU)RU\TPU\pers\30974 |9 15211 | |
| 701 | 1 | |a Zamyatina |b O. M. |c Specialist in the field of informatics and computer technology |c Associate Professor of Tomsk Polytechnic University, Candidate of technical sciences |f 1978- |g Oksana Mikhailovna |3 (RuTPU)RU\TPU\pers\31670 |9 15807 | |
| 801 | 2 | |a RU |b 63413507 |c 20180306 |g RCR | |
| 856 | 4 | |u http://link.springer.com/chapter/10.1007/978-3-642-25661-5_72 | |
| 942 | |c CF | ||