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
Число страниц6
СостояниеОпубликовано - 2011

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

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

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Подробные сведения о темах исследования «Theorem about amplification of relational algebra by recursive objects». Вместе они формируют уникальный семантический отпечаток (fingerprint).