Types of Databases

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/databases/basics-of-dbms/types-dba-functions/asset-types-of-databases after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Theory of Computation: 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
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

  1. 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. 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.

  3. 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.

  4. 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.

Loading lesson…