Rename Operation

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/dbms/relational-algebra/rename-operation/asset-rename-operation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces the Rename operation in Relational Algebra, denoted by the Greek letter rho ($

ho$), which assigns a name to the result of an expression. The instructor demonstrates its syntax and utility through two distinct examples: first, calculating a total amount with interest and renaming the resulting table, and second, finding the maximum loan amount using a self-join and set difference operation.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor begins by explaining that results of relational algebra operations are relations but lack names. To address this, he introduces the Rename operation, denoted by the small Greek letter rho ($ ho$). He writes the formal syntax on the board: $ ho_{X(A1, A2, A3, A4, ..., AN)}(E)$. Here, $E$ represents the expression whose result is being named, and $X$ is the new name assigned to that relation. The attributes $A1$ through $AN$ represent the new column names. He illustrates this concept by writing 'find student' on the board, showing how a relation could be renamed to 'student' with specific attributes, emphasizing that this operation is essential for referencing intermediate results in complex queries.

  2. 2:00 – 5:00 02:00-05:00

    The lecture transitions to a practical problem: 'Write a RELATIONAL ALGEBRA query to find the account_no along with balance with 8% interest as total amount, with table name as balance sheet?'. The instructor identifies the 'account' table as the source. He constructs a projection $\Pi$ to select the account number and calculate the new balance column using the formula $balance imes 1.08$. He then applies the rename operator to this projection, writing $ ho_{balance\_sheet(account\_no, total\_amount)}$. This step assigns the name 'balance_sheet' to the resulting relation and explicitly names the columns 'account_no' and 'total_amount', demonstrating how to combine calculation, selection, and renaming in a single query structure.

  3. 5:00 – 6:19 05:00-06:19

    The final segment addresses a more complex query: 'Write a RELATIONAL ALGEBRA query to find the loan_no with maximum loan amount?'. The instructor explains that finding a maximum value typically requires comparing every record against every other record. He writes a self-join using the Cartesian product: $ ho_A(loan) imes ho_B(loan)$, where the loan table is renamed to A and B. He then constructs a selection $\sigma_{A.loan\_amount < B.loan\_amount}$ to find pairs where one loan is smaller than another. By subtracting these smaller loans from the original set of loan numbers using set difference, he isolates the loan number that is not smaller than any other, effectively finding the maximum. He draws a small numerical table (10, 20, 30) to visually demonstrate which pairs are eliminated during this process.

The video effectively bridges theoretical definitions with practical application. It starts by defining the Rename operation as a necessary tool for naming unnamed relational results. It then immediately applies this to a financial calculation example, showing how to compute new values and name the output table. Finally, it escalates the complexity by introducing the set difference operator combined with a self-join to solve a 'maximum' problem, illustrating that relational algebra can handle complex logic like finding extrema through set operations rather than just simple filtering.

Loading lesson…