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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ACM International Conference Proceeding Series; Vol. 10: Proceedings of the 12th Australasian database conference : Queensland, Australia; 29 Jan.-01 Feb. 2001 s. 52 - 59
Hlavní autor: Schewe, Klaus-Dieter
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 29.01.2001
Edice:ACM Other Conferences
Témata:
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Algebraic algorithms
Information systems > Data management systems > Database management system engines
Information systems > Data management systems > Database management system engines > Database query processing
Information systems > Information storage systems > Record storage systems > Directory structures > B-trees
Mathematics of computing > Discrete mathematics > Graph theory > Trees
Software and its engineering > Software notations and tools > Formal language definitions > Semantics
Theory of computation > Semantics and reasoning
Theory of computation > Semantics and reasoning > Program semantics
Theory of computation > Theory and algorithms for application domains > Database theory > Database query processing and optimization (theory)
query algebra
structural recursion
rational tree
ISBN:9780769509662, 0769509665
ISSN:1530-0919
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780769509662
0769509665
ISSN:1530-0919
DOI:10.5555/545538.545544