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.
| Original language | English |
|---|---|
| Title of host publication | Advances in Intelligent and Soft Computing |
| Pages | 591-596 |
| Number of pages | 6 |
| Volume | 123 |
| DOIs | |
| Publication status | Published - 2011 |
Publication series
| Name | Advances in Intelligent and Soft Computing |
|---|---|
| Volume | 123 |
| ISSN (Print) | 18675662 |
Keywords
- database
- domain
- recursive table
- relational algebra
- relational operations
- tuple
ASJC Scopus subject areas
- Computer Science(all)
Fingerprint Dive into the research topics of 'Theorem about amplification of relational algebra by recursive objects'. Together they form a unique fingerprint.
Cite this
Sokolova, V. V., & Zamyatina, O. M. (2011). Theorem about amplification of relational algebra by recursive objects. In Advances in Intelligent and Soft Computing (Vol. 123, pp. 591-596). (Advances in Intelligent and Soft Computing; Vol. 123). https://doi.org/10.1007/978-3-642-25661-5_72