Types of Databases

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-07-database-management-systems/basics-of-dbms/types-dba-functions/asset-types-of-databases after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…