Wednesday 6 August 2014

Relational Query Languages |RELATIONAL COMPLETENESS


RELATIONAL COMPLETENESS

The notion of relational completeness was propounded by codel in 1972 as a basis for evaluating the power of different query language.A language is relation-ally complete if the basic relational algebra operation can be performed.The basic relational algebra operations are-
  • UNION
  • CROSS PRODUCT
  • SELECTION
  • DIFFERENCE
  • PROJECTION
Query language that are actually used in practice provides features in addition to one mentioned above.

FOR EXAMPLE-They provides the facilities for-
  • Modification,storage and deletion information
  • Printing relation
  • Assigning relation to some relation name
  • Computing aggregate function like Sum and Max
  • Performing Arithmetic operation

1 comment:

  1. Wow it is really wonderful and awesome thus it is very much useful for me to understand many concepts and helped me a lot. it is really explainable very well and i got more information from your blog.

    Digital Marketing Training in Chennai

    Digital Marketing Course in Chennai

    ReplyDelete