Secondary Indexing

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/database-management-systemdbms/file-organization-indexing/basics-types-of-indexing/asset-secondary-indexing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed explanation of Secondary Indexing within the context of database file organization. The instructor begins by outlining the scenario where a primary index already exists on a primary key, but frequent queries are required on other attributes. He uses a 'Student' table example to demonstrate how a secondary index on the 'Name' attribute allows for efficient retrieval. The lecture covers the structural differences between the main file and the index file, emphasizing that the index is ordered by the secondary key while the main file remains ordered by the primary key. It concludes by defining secondary indexing as a dense index, where every record in the main file has a corresponding entry in the index file.

Chapters

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

    The session starts with a slide titled 'SECONDARY INDEXING' which reads, 'Most common scenarios, suppose that we already have a primary indexing on primary key, but there is frequent query on some other attributes.' The instructor explains that to handle these frequent queries, a separate index file is created. He draws a large box representing the 'Student' main file, labeling columns 'Roll' and 'Name'. He notes that the main file is ordered according to the primary key (Roll). He then draws a smaller box to represent the secondary index, explaining that this index will be ordered by the 'Name' attribute, allowing users to search by name efficiently even though the physical file is sorted by roll number.

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

    The instructor continues to build the diagram, drawing arrows from the 'Name' index entries to the specific records in the 'Student' file. He clarifies that the index file is ordered by the secondary key (Name), but the main file is ordered by the primary key (Roll). This means the index acts as a pointer to the physical location of the records. He emphasizes that the index file contains an entry for every single record in the main file. He draws a separate index structure labeled 'Name' and shows how it maps to the 'Student' file, illustrating the one-to-one correspondence between the index entries and the main file records. This visual aid helps clarify how the database engine navigates from the index to the actual data.

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

    The slide changes to highlight key characteristics: 'Secondary indexing can be done on key or non-key attribute,' 'No of entries in the index file is same as the number of entries in the main file,' and 'It is an example of dense indexing.' The instructor reinforces that because every record in the main file has an entry in the index, it is classified as a dense index. He draws a diagram showing the index file and the main file ('MF'), with arrows indicating that every record in the main file is referenced. He explains that this is a fundamental property of secondary indexing, distinguishing it from sparse indexing where only some records have index entries. This ensures that any record can be found using the secondary key.

The video effectively transitions from the theoretical motivation for secondary indexing to its practical implementation. By using the 'Student' example, the instructor clarifies the distinction between the ordering of the main file and the index file. The progression culminates in the definition of secondary indexing as a dense index, ensuring that the lecture provides a complete understanding of how secondary keys facilitate data retrieval in database systems.

Loading lesson…