On the expressive power of the relational algebra with partially ordered domains

International Journal of Computer Mathematics

Volumn 74, Issue 1, 2000, Pages 53-62

  Ng, Wilfred ^a   Levene, Mark ^a   Fenner, Trevor I ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; QUERY LANGUAGES; SET THEORY;

AUTOMORPHISM; PARTIALLY ORDERED DOMAINS; RELATIONAL ALGEBRA;

RELATIONAL DATABASE SYSTEMS;

EID: 0033742251     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207160008804922     Document Type: Article

References (8)

1. Atzeni, P. and De Antonellis, V. (1993). Relational Database Theory. Benjamin/Cummings Publishing Company, Inc.
2. Bancilhon, F. (1978). On the Completeness of Query Languages for Relational Databases. In LNCS 64: Mathematical Foundations of Computer Science, Springer-Verlag, pp. 112-124.
3. Chandra, A. K. and Harel, D. (1980). Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21, 156-178.
4. Ginsburg, S. and Hull, R. (1986). Sort Sets in the Relational Model. Journal of the Association for Computing Machinery, 33(3), 465-488.
5. Halmos, P. (1974). Naive Set Theory, Springer-Verlag, New York.
6. Levene, M. and Loizou, G. (1999). A Guided Tour of Relational Databases and Beyond, London, Springer-Verlag.
7. Maier, D. and Vance, B. (1993). A Call to Order. In: Proceedings of the Twelfth ACM Symposium on Principles of Databases Systems, pp. 1-16.
8. Paredaens, J. (1978). On the Expressive Power of the Relational Algebra. Information Processing Letter, 7(2), 107-111.