Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-19T12:31:08.975Z Has data issue: false hasContentIssue false
  • English
  • Français

Repetitions and permutations of columnsin the semijoin algebra

Published online by Cambridge University Press:  05 June 2008

Dirk Leinders  and
Jan Van Den Bussche
Dirk Leinders
Affiliation:
Hasselt University and Transnational University of Limburg Agoralaan, gebouw D, 3590 Diepenbeek Belgium; [email protected]
Jan Van Den Bussche
Affiliation:
Hasselt University and Transnational University of Limburg Agoralaan, gebouw D, 3590 Diepenbeek Belgium; [email protected]
Get access

Abstract

Codd defined the relational algebra [E.F. Codd, Communications of the ACM13 (1970) 377–387;E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the join operation, one can rewrite any relational algebra expression into an equivalent expression where no projection operator permutes or repeats columns. The fragment of the relational algebra known as the semijoin algebra, however, lacks a full join operation. Nevertheless, we show that any semijoin algebra expression can still be simulated in a natural way by a set of expressions where no projection operator permutes or repeats columns.

Keywords

Databaserelational algebrasemijoin algebraprojection.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 43 , Issue 2 , April 2009 , pp. 179 - 187
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases. Addison-Wesley (1995).
Andréka, H., Németi, I. and van Benthem, J., Modal languages and bounded fragments of predicate logic. J. Philosophical Logic 27 (1998) 217–274. CrossRef
Codd, E.F., A relational model of data for large shared data banks. Communications of the ACM 13 (1970) 377–387. CrossRef
E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed. Prentice-Hall (1972) pp. 65–98.
Grädel, E., On the restraining power of guards. J. Symbolic Logic 64 (1999) 1719–1742. CrossRef
Grädel, E., Guarded fixed point logics and the monadic theory of countable trees. Theor. Comput. Sci. 288 (2002) 129–152. CrossRef
Grädel, E., Hirsch, C. and Otto, M., Back and forth between guarded and modal logics. ACM Transactions on Computational Logic 3 (2002) 418–463. CrossRef
E. Grädel and I. Walukiewicz, Guarded fixed point logic, in Proceedings of the 14th IEEE Symposium on Logic in Computer Science LICS '99 (1999) pp. 45–54.
Leinders, D. and Van den Bussche, J., On the complexity of division and set joins in the relational algebra. J. Comput. Syst. Sci. 73 (2007) 538–549. Special issue with selected papers on database theory. CrossRef
D. Leinders, M. Marx, J. Tyszkiewicz and J. Van den Bussche, The semijoin algebra and the guarded fragment. J. Logic, Language and Information 14 (2005) 331–343.
Leinders, D., Tyszkiewicz, J. and Van den Bussche, J., On the expressive power of semijoin queries. Inform. Process. Lett. 91 (2004) 93–98. CrossRef