“My DBMS mark is 82.”
A simple view relevant to one user.
CodeBhavya
Learn how a DBMS separates user views, logical design and physical storage—and how different data models organize relationships.
A student checking a result should not need to know which disk page stores the marks.
A simple view relevant to one user.
The complete logical relationships and rules.
The physical structures used for efficient access.
The relatively stable definition or blueprint: tables, fields, relationships and constraints.
STUDENT(student_id, name, branch)The actual data stored at a particular moment. It changes whenever rows are inserted, updated or deleted.
(101, 'Anu', 'AIML')Select each level to see who uses it, what it contains and what it deliberately hides.
name, enrolled_courses, own_resultscourse, student_list, marks_entrystudent, skills, eligibility, applicationsSelect a change and predict whether user programs should need modification.
Examples: add an index, change file organization, move data to faster storage or alter page layout.
Usually easier to achieveExamples: split a table, add an attribute or introduce a new relationship while preserving user-facing views.
Usually harder to achieveUse the buttons to trace the effect.
A model is not merely a drawing style. It establishes how data is represented and connected.
Describes the real-world meaning of data independently of implementation.
Example: ER modelDescribes records and relationships without exposing storage details.
Examples: relational, hierarchical, networkDescribes record layout, files, indexes, partitions and access paths.
Example: B+ tree index over disk pages| Model | Main structure | Relationship strength | Good fit | Main limitation |
|---|---|---|---|---|
| Hierarchical | Tree | Parent–child; normally one parent | Stable hierarchies and directory-like data | Many-to-many relationships are awkward |
| Network | Graph-like records and links | Multiple parents and many-to-many | Complex navigational relationships | Structural navigation makes programs tightly coupled |
| Relational | Tables | Keys and joins | Business systems and structured querying | Deeply nested or graph traversal can require many joins |
| Object-oriented | Objects and classes | References and inheritance | Complex objects closely matching application code | Less universal tooling and query conventions |
| Document | JSON-like documents | Embedding and references | Flexible, evolving aggregate records | Duplication and cross-document consistency need care |
| Key–value | Key mapped to opaque value | Mostly application-managed | Caches, sessions and very fast direct lookup | Limited ad-hoc querying and relationships |
There is no universally best model. Start from access patterns, relationships and consistency needs.
“Tier” describes deployment separation. It is different from the three-schema levels of abstraction.
Answers appear immediately because these questions teach rather than rank you.
Mark this level when you can draw the three-schema architecture and explain both forms of data independence without notes.
Saved in this browser only.