Types of Databases

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-6-database-management-system/basics-of-dbms/types-dba-functions/asset-types-of-databases after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…