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...
Saved in:
| Published in: | ACM International Conference Proceeding Series; Vol. 10: Proceedings of the 12th Australasian database conference : Queensland, Australia; 29 Jan.-01 Feb. 2001 pp. 52 - 59 |
|---|---|
| Main Author: | |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
Washington, DC, USA
IEEE Computer Society
29.01.2001
|
| Series: | ACM Other Conferences |
| Subjects: |
Computing methodologies
> Symbolic and algebraic manipulation
> Symbolic and algebraic algorithms
> Algebraic algorithms
Information systems
> Data management systems
> Database management system engines
> Database query processing
Information systems
> Information storage systems
> Record storage systems
> Directory structures
> B-trees
Software and its engineering
> Software notations and tools
> Formal language definitions
> Semantics
|
| ISBN: | 9780769509662, 0769509665 |
| ISSN: | 1530-0919 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!