Secondary Indexing
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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
- 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)
- Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
- Java (Cluster 1): Java
- ANSI SQL MySQL (Cluster 1,2,3): SQL
- HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
- Python (Cluster 2): Python for Placements by Yash Sir
- Cloud Fundamentals (Cluster 2): Emerging Tech Trends
- C# (Cluster 3): C#
- OOPs: Object Oriented Programming (OOPS)
- Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- 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
- 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
- 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 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.