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

    Fingerprint

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