On the unification of query algebras and their extension to rational tree structures

Author

Schewe, Klaus-Dieter

Author_Institution

Dept. of Inf. Sci., Massey Univ., Palmerston North, New Zealand

fYear

2001

fDate

2001

Firstpage

52

Lastpage

59

Abstract

In order to come to a unification of existing query algebras, especially for object bases, it is necessary to understand the semantic differences between different data models and associated query algebras. It is argued that all existing query algebras can be expressed by the operations provided by an underlying type system plus a single join-operator. This is still true, if rational tree types are allowed and if these are implemented by using object identifiers. The unification exploits the concept of structural recursion

Keywords

data models; database theory; object-oriented databases; process algebra; query processing; relational algebra; tree data structures; data models; join operator; object identifiers; object oriented databases; query algebras; rational tree structures; semantic difference; structural recursion; type system; unification; Algebra; Data models; Information systems; Object oriented databases; Object oriented modeling; Terminology; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Database Conference, 2001. ADC 2001. Proceedings. 12th Australasian

Conference_Location

Gold Coast, Qld.

ISSN

1530-0919

Print_ISBN

0-7695-0966-5

Type

conf

DOI

10.1109/ADC.2001.904464

Filename

904464