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
-
What is class based modeling Class-based modeling represents the objects that the system will manipulate, the operations (also called meth...
-
Class-Responsibility-Collaborator (CRC) Modeling Class-responsibility-collaborator (CRC) modeling [Wir90] provides a simple means for ident... -
Syllabus Text Book Reference Book ---------------------------------------------------------------------------...
-
QUESTION BANK Unit 1 part1 Explain different Phases of software project. Define Quality assurance and quality cont...
-
Characteristics of Good SRS[Software Requirement Specification] Following are the characteristics of a good SRS document: Correctness: U...
-
Book Syllabus Unit 1: Lecture 1: PPT Definition, characteristics, Myths,Crisis Lecture 2: PPT1 PPT2 Lecture 3: PPT SDLC, Build ...
-
Syllabus Unit 1: Principles of Testing, Software development life cycle model: Phases of s...
-
Unit 1: Principles of Testing Software development life cycle model: Phases of software project, Quality, Quality assurance and quality co...
-
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...
-
Question Bank 1: A. Explain the "Pesticide paradox" in software testing and how to avoid it. B. Differentiate between verification...
0 Comment to " Relational algebra"
Post a Comment
Note: Only a member of this blog may post a comment.