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...
-
Characteristics of Good SRS[Software Requirement Specification] Following are the characteristics of a good SRS document: Correctness: U...
-
Relational Calculus Relational calculus is a non-procedural query language. In the non-procedural query language, the user is concerned wi...
-
Exercise 1 Exercise 2 Exercise 3 Exercise 4 Exercise 5 Exercise 6 Exercise 7 Exercise 8 Exercise 9
-
ER model stands for an Entity-Relationship model. It is a high-level data model. This model is used to define the data elements and relation...
-
syllabus Question Bank DATA PRIVACY MTCSPE1001D UNIT I Questions Define data linking and profiling in the context of privacy. ...
-
QUESTION BANK Unit 1 part1 Explain different Phases of software project. Define Quality assurance and quality cont...
0 Comment to " Relational algebra"
Post a Comment
Note: Only a member of this blog may post a comment.