Secondary Indexing
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- 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
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- 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
- 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
- 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
- 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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
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: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.
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.

