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

References

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