Relational algebra is a procedural query language, which takes instances of relations as input and yields instances of relations as output. It uses operators to perform queries. An operator can be either unary or binary. They accept relations as their input and yield relations as their output.
Sunday
Subscribe to:
Post Comments (Atom)
Weekly
-
Class-Responsibility-Collaborator (CRC) Modeling Class-responsibility-collaborator (CRC) modeling [Wir90] provides a simple means for ident... -
Syllabus Text Book Reference Book ---------------------------------------------------------------------------...
-
What is class based modeling Class-based modeling represents the objects that the system will manipulate, the operations (also called meth...
-
Text books Course objectives and Course Outcomes UNIT I: Fundamentals of Data Communication and Computer Network [08 Hours] Data and Informa...
-
syllabus Question Bank DATA PRIVACY MTCSPE1001D UNIT I Questions Define data linking and profiling in the context of privacy. ...
-
Relational Calculus Relational calculus is a non-procedural query language. In the non-procedural query language, the user is concerned wi...
-
Week 1: Indian Knowledge System – An Introduction Define Indian Knowledge System (IKS) and explain its significance. Why is it neces...
-
Characteristics of Good SRS[Software Requirement Specification] Following are the characteristics of a good SRS document: Correctness: U...
-
Two devices can communicate in simplex, half-duplex or full-duplex mode. Simplex: In simplex mode, the communication is unidirectional. Onl... -
Syllabus ------------------------------------------------------------------------------------------------ UNIT I Image fundamentals: Image ...
0 Comment to " Relational algebra"
Post a Comment
Note: Only a member of this blog may post a comment.