Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Positive Relational Algebra

  • Cristina SirangeloEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1251


SPJRU-algebra; SPCU-algebra


Positive relational algebra is the fragment of relational algebra which excludes the difference operator. Relational algebra queries are expressions defining mappings from database instances of an input database schema to an output relation. In particular a positive relational algebra query over a database schema τ is one of the following expressions, each one with an associated set of attributes:
  • A constant relation over a set of attributes U is a positive relational algebra query with associated set of attributes U.

  • If R(U) is a relation schema in τ, the relation symbol R is a positive relational algebra query with associated set of attributes U.

  • If Q and Q′ are positive relational algebra queries with sets of attributes U and U′, respectively, the following are positive relational algebra queries:
    • The selection σA=B (Q) or σA=c (Q), with set of attributes U, where A and B are attributes in U, and c is a constant value

    • The projection π X...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.IRIFParis Diderot UniversityParisFrance

Section editors and affiliations

  • Leonid Libkin
    • 1
  1. 1.School of InformaticsUniversity of EdinburghEdinburghUK