Join With Using

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/database-management-system/sql/join-operations-inner-outer/asset-join-with-using after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture focuses on SQL database operations, specifically the `Join` and `Inner Join` constructs. The instructor explains that while a join operation works similarly to a Cartesian product, the `using` keyword provides additional functionality. The lesson distinguishes between standard joins and joins utilizing the `USING` clause, highlighting how the latter allows for explicit column selection. This is crucial for managing scenarios where multiple columns are common between two tables, ensuring only specific columns are considered for the join condition rather than all common attributes. The instructor emphasizes the practical application of this syntax in database management.

Chapters

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

    The instructor presents a slide titled 'Join /inner join'. The text states a join works like a Cartesian product but gains functionality with the `using` keyword. Point 2 explains that `Join with using` allows explicitly choosing columns for comparison. The slide notes this is useful 'if there are more than one column which are common between two table but we do not want each of them to be considered,' allowing the user to control which columns trigger the join and remove redundant tuples from the result, ensuring cleaner data output. The slide text explicitly mentions the removal of redundant tuples as a key benefit of this specific join syntax. The slide background is white with black text, and the title is underlined. The instructor is visible in the bottom right corner, wearing a white shirt and glasses, speaking into a microphone.

  2. 2:00 – 2:27 02:00-02:27

    The slide updates to a technical example involving relations $R_1(A, B, C)$ and $R_2(B, C, D)$. The text states join is a form of natural join construct allowing specification of exactly which columns to equate. The instructor underlines key phrases in red. The text explains that for the operation $R_1 ext{ join } R_2 ext{ using } (B)$, tuples match if $t_1.B = t_2.B$. Crucially, it notes that even if both tables have attribute C, 'it is not required that $t_1.C = t_2.C$,' contrasting this behavior with a standard natural join. The instructor uses a digital pen to write in red ink, drawing a natural join symbol between the relations and underlining the phrase 'not required' to stress the difference. The slide also includes a logo for 'Knowledge Gate Educator' in the bottom left corner.

The lecture progresses from a high-level definition of the `JOIN` operation to a specific technical comparison with `NATURAL JOIN`. By using the example of relations $R_1$ and $R_2$ sharing attributes B and C, the instructor clarifies that `JOIN ... USING (B)` restricts the equating condition to only column B. This prevents the automatic equating of column C, which would happen in a natural join. The handwritten annotations emphasize the 'not required' aspect, reinforcing that `USING` offers precise control over join conditions. This distinction is vital for writing efficient and correct SQL queries in academic and professional settings.

Loading lesson…