The structure of the relational database model
The structure of the relational database model
Reloop, an algebra-based query language for O2
Building an object-oriented database system
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
A Query Algebra for Object-Oriented Databases
A Query Algebra for Object-Oriented Databases
Design theory for advanced datamodels
ADC '01 Proceedings of the 12th Australasian database conference
Querying Web Information Systems
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Using reflection for querying XML documents
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Component-driven engineering of database applications
APCCM '06 Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53
A multi-level architecture for distributed object bases
Data & Knowledge Engineering
Distribution design for higher-order data models
Data & Knowledge Engineering
A heuristic approach to cost-efficient derived horizontal fragmentation of complex value databases
ADC '07 Proceedings of the eighteenth conference on Australasian database - Volume 63
Refinements in typed abstract state machines
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
| Hi-index | 0.00 |
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.