Rename Operations

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/database-management-systemdbms/sql/order-by-rename-operation-alias/asset-rename-operations after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a comprehensive overview of SQL aliases and their practical application in database queries. It begins with a theoretical explanation of what aliases are, emphasizing that they create temporary names for tables or columns without modifying the underlying database. The instructor then transitions to practical examples, starting with a query that calculates a balance with 8% interest and assigns it a new alias. This is followed by a more complex query involving a join between the `account` and `branch` tables to retrieve specific details. Finally, the lecture concludes with a challenging problem: finding the loan number with the maximum loan amount, for which the instructor demonstrates a self-join technique using set difference logic.

Chapters

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

    The session opens with a slide titled "Alias Operation/rename". The instructor details four key points about SQL aliases. First, they are temporary names for tables or columns, creating a "new copy" view without changing the database. Second, they improve readability. Third, they utilize the `as` clause in the form `old-name as new-name` within `select` and `from` clauses. Fourth, their scope is limited to the query duration. The instructor physically underlines these concepts on the slide to highlight their importance for students, specifically emphasizing that aliases do not alter the actual data structure and exist only for the query duration.

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

    The instructor presents a specific problem: "Write a SQL query to find the account_no along and balance with 8% interest, as Account, total_balance?". He constructs the query by selecting `account_no` and calculating `balance * 1.08`. He explicitly adds the alias `as total_balance` to the calculated column. He explains that this allows the result to be displayed with a more descriptive name. He draws a small table on the right side of the screen to visualize the output, labeling the columns `A_no` and `T_B` to represent the account number and total balance respectively.

  3. 5:00 – 8:14 05:00-08:14

    The lecture moves to a query asking for account numbers along with branch names and cities. The instructor writes a query joining the `branch` and `account` tables using aliases `B` and `A` and a `where` clause to match branch names. He then introduces a final, more complex question: "Write a SQL query to find the loan_no with maximum loan amount?". He explains a method using the `minus` operator. He writes a query that selects amounts from the loan table and subtracts amounts that are less than any other amount in a self-join (`Select A.amount from loan as A, loan as B where A.amount < B.amount`). He draws a diagram with numbers 10, 20, and 30 to illustrate how the logic filters out non-maximum values, leaving only the maximum amount. He circles the pairs to show the comparison process. The background shows a hand-drawn ER diagram with tables like `branch`, `account`, `deposit`, `customer`, `loan`, and `borrower`, which provides context for the table names used in the queries.

The video effectively bridges the gap between SQL theory and practice. It starts by establishing the fundamental concept of aliases as temporary, non-destructive naming tools. The progression then moves to applying these tools in arithmetic expressions to create readable output columns. The complexity increases with the introduction of table joins to combine data from multiple sources. Finally, the lesson culminates in a set-theoretic approach to finding maximum values, demonstrating how SQL can handle complex logic through self-joins and set operations. This structured approach helps students understand not just syntax, but the logical reasoning behind query construction, preparing them for more advanced database management tasks. The use of a consistent ER diagram in the background helps students visualize the relationships between tables like `account`, `branch`, and `loan`.

Loading lesson…