Types of Databases
Duration: 11 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 lecture introduces database classification by structure, usage, storage methods, and intended application. It begins with hierarchical databases, using a university tree diagram (University → Departments/Administration; Departments → Students/Faculty/Resources) and annotating it as a Tree/Data Structure, with an RDBMS comparison. It then covers network databases, adding a Clubs node linked to multiple parents in a graph-like structure. The lesson moves to object-oriented databases, showing Person objects with attributes and relationships such as ofType() and livesAt(), before explaining relational databases using student tables (Roll no., Student Name, Marks Awarded) and a Key = 94 link to Rank/Scholarship. The final segment emphasizes rows as records, columns as attributes, unique identity for relationships, and a hybrid formula: Hybrid => RDMS + CODDBAS.
Chapters
0:00 – 2:00 00:00-02:00
The opening slide, titled “Types of Databases,” states that databases can be classified by structure, usage, storage methods, and intended application. The first topic is “Hierarchical Databases,” described as organizing data in a tree-like structure where each parent record can have multiple child records. A green node diagram shows “University” at the top, branching to “Departments” and “Administration,” with “Departments” further branching to “Students,” “Faculty,” and “Resources.” The instructor adds red handwritten notes such as “Data Structures” beside the diagram, reinforcing that hierarchical models are based on tree-like data structures.
2:00 – 5:00 02:00-05:00
The lecture continues with the hierarchical model, underlining key phrases in red and circling a handwritten “Tree” label next to the university diagram. An additional annotation, “RDBMS -> Array of Structure,” appears below the circled Tree label, suggesting a comparison between hierarchical/tree structures and relational storage. The instructor gestures while explaining parent-child relationships in the university example, emphasizing that each lower level depends on a single parent path. The section then transitions to “Network Databases,” which extend the hierarchical idea by allowing child records to link to multiple parent records. A new green “Clubs” box is added with arrows reaching into “Students,” “Faculty,” and “Resources,” and the instructor writes “Graph” in red to highlight the more flexible, web-like structure.
5:00 – 10:00 05:00-10:00
The presentation shifts to “Object-Oriented Databases,” showing an object diagram with a green “Person” box containing Name, Phone Number, and Email Address. Arrows labeled “ofType()” connect Person to “Student” and “Professor,” while an arrow labeled “livesAt()” connects Person to “Address.” Red pen marks underline the paragraph and circle the word “objects,” emphasizing that data is stored as objects with attributes and relationships. The next slide, “Relational Databases,” displays three tables of student data with a handwritten red note reading “Array of Structure” above them. A label “Key = 94” connects the top-left table (columns Roll no., Student Name, Marks Awarded) to a middle table listing Rank and Scholarship for the two students with 94 marks, demonstrating how relational tables are linked through shared keys.
10:00 – 11:04 10:00-11:04
The final segment explains that relational databases store data in tables where rows represent records and columns represent attributes. The instructor points to the student table showing Roll no., Student Name, and Marks Awarded, and writes “Array of Structures” on the screen to connect relational storage with structured data concepts. The lecture highlights that every piece of information has a relationship with other data because each record has a unique identity. A handwritten formula, “Hybrid => RDMS + CODDBAS,” appears on the slide, indicating that hybrid databases combine relational and object-oriented approaches.
The lecture progresses from structural classification to specific database models. Hierarchical databases are introduced first as tree structures with single-parent relationships, illustrated by the university example and annotated as Tree/Data Structure. Network databases are then presented as a more flexible graph model where children can have multiple parents, shown by the added Clubs node. Object-oriented databases are explained through Person objects with attributes and method-like relationships (ofType(), livesAt()), emphasizing object-based storage. Relational databases are taught using student tables, where rows are records, columns are attributes, and unique keys enable relationships across tables. The final hybrid formula ties relational and object-oriented models together, providing a concise summary of database type combinations.

