MCA-108 Advanced Database Management Systems Notes by Unnati Educations cover all 4 units of the GGSIPU MCA Semester 2 Core Elective-I paper in a 72-page book: 70 numbered topics, 26 labelled diagrams and 88 important questions (48 short-answer, 40 long-answer), mapped to the MCA syllabus that applies from academic session 2025-26 onwards.
Written by Prateek Talwar, Founder, Unnati Educations · Reviewed by Ritik Rawat, B.Tech, Senior Full Stack Developer · Checked against GGSIPU MCA Scheme of Examination and Detailed Syllabus (A.S. 2025-26 onwards), 13 October 2026 · Updated 14 October 2026 · Editorial policy
Scheme: MCA scheme 2025-26 (BoS USIC&T, 28/07/2025) | Applies to: MCA at affiliated institutes, academic session 2025-26 onwards | Verified against: MCA Scheme of Examination and Detailed Syllabus, 13 October 2026
MCA-108 Advanced Database Management Systems at a glance: GGSIPU MCA Sem 2 credits, units and exam pattern
MCA-108 is one of ten Core Elective-I options, chosen instead of papers such as MCA-110 or MCA-116. It sits with the other GGSIPU MCA Semester 2 papers and carries 4 credits against 3 for each core paper.
| Item | MCA-108 detail |
|---|---|
| Course and semester | MCA (2 years), Semester 2 |
| Category and credits | Core Elective-I (choose any one) · 4 credits · L 3, T 1 per week |
| Marks | Out of 100; end-term questions total 60 (internal split not printed in the official PDF) |
| Pass mark | 40 out of 100 (scheme, Note 9) |
| End-term pattern | Compulsory Q1 (short-answer, whole syllabus) 12 marks, then one of two questions per unit at 12 marks each (12 + 48 = 60 marks) |
| Units and hours | 4 units: 10, 10, 10 and 12 teaching hours |
| Applies to | Affiliated institutes, session 2025-26 onwards |
| Paired lab | MCA-168 Advanced Database Management Systems Lab, 0-2, 1 credit; marks not printed |
MCA-108 snapshot from the official MCA scheme (2025-26)
- Item
- Course and semester
- MCA-108 detail
- MCA (2 years), Semester 2
- Item
- Category and credits
- MCA-108 detail
- Core Elective-I (choose any one) · 4 credits · L 3, T 1 per week
- Item
- Marks
- MCA-108 detail
- Out of 100; end-term questions total 60 (internal split not printed in the official PDF)
- Item
- Pass mark
- MCA-108 detail
- 40 out of 100 (scheme, Note 9)
- Item
- End-term pattern
- MCA-108 detail
- Compulsory Q1 (short-answer, whole syllabus) 12 marks, then one of two questions per unit at 12 marks each (12 + 48 = 60 marks)
- Item
- Units and hours
- MCA-108 detail
- 4 units: 10, 10, 10 and 12 teaching hours
- Item
- Applies to
- MCA-108 detail
- Affiliated institutes, session 2025-26 onwards
- Item
- Paired lab
- MCA-108 detail
- MCA-168 Advanced Database Management Systems Lab, 0-2, 1 credit; marks not printed
MCA-108 Advanced Database Management Systems Notes unit-wise: 70 topics, 26 diagrams and 88 important questions across 4 units
Each unit closes with 22 important questions and a Quick Revision Table. The official PDF numbers the units without titles, so the headings below use the notes' unit titles. Notes for the other papers sit under GGSIPU MCA notes; one page per unit is in the sample PDF above.
MCA-108 Unit 1: Relational Databases, Query Processing and Optimization
Pages 4 to 21. Integrity constraints, EER, functional dependency, closure, canonical cover and 1NF to 5NF, then the cost of selection, sorting and joins, equivalence rules, heuristic and cost-based optimisation and indexing. It has 17 topics, 6 figures and 3 boxed solved examples.
| Join algorithm | Block transfers |
|---|---|
| Nested loop | 5000 × 400 + 100 = 2,000,100 |
| Block nested loop | 100 × 400 + 100 = 40,100 |
| Merge join (sorted) | 100 + 400 = 500 |
| Hash join | 3(100 + 400) = 1,500 |
Quick look: join costs, depositor (100 blocks) with customer (400 blocks) (from page 16)
- Join algorithm
- Nested loop
- Block transfers
- 5000 × 400 + 100 = 2,000,100
- Join algorithm
- Block nested loop
- Block transfers
- 100 × 400 + 100 = 40,100
- Join algorithm
- Merge join (sorted)
- Block transfers
- 100 + 400 = 500
- Join algorithm
- Hash join
- Block transfers
- 3(100 + 400) = 1,500
MCA-108 Unit 2: NoSQL Databases, CouchDB, MongoDB and Big Data
Pages 22 to 38. NoSQL, CAP, BASE and the four store types; hands-on CouchDB through curl, Mango _find queries and map and reduce views; mongosh CRUD, aggregation and sharding; then the 5 V's and Hadoop. It has 16 topics and 6 figures.
Quick look: a CouchDB reduce view grouped by key (from page 31)
GET /college/_design/students/_view/count_by_course?group=true
-> {"rows":[{"key":"BCA","value":1},
{"key":"MBA","value":1},
{"key":"MCA","value":2}]}With group=true, _count returns one count per course, not one total.
MCA-108 Unit 3: Object Oriented DBMS and XML
Pages 39 to 55. The OO paradigm and OODBMS manifesto, architectures, object identity, encapsulation, the ODMG model in ODL, inheritance, extents, storage issues such as pointer swizzling, SQL:1999 object types, then XML structure, DTD, XSD and storage. It has 18 topics and 4 figures.
| Cardinality | Representation in ODL |
|---|---|
| 1:1 | Single reference on both sides |
| 1:N | set<…> on the "one" side, single reference on the "many" side |
| M:N | set<…> on both sides (a class if it has attributes) |
Quick look: relationship cardinality in ODL (from page 44)
- Cardinality
- 1:1
- Representation in ODL
- Single reference on both sides
- Cardinality
- 1:N
- Representation in ODL
set<…>on the "one" side, single reference on the "many" side
- Cardinality
- M:N
- Representation in ODL
set<…>on both sides (a class if it has attributes)
MCA-108 Unit 4: Distributed Databases, Advanced Transactions and Database Models
Pages 56 to 72. Transparency, homogeneous and heterogeneous systems, DDBMS architectures, replication and fragmentation, commit protocols, distributed locking, recovery and the semijoin; then real-time, long-duration and nested transactions and six advanced database models. It has 19 topics and 10 figures.
| Deadline | If missed | Example |
|---|---|---|
| Hard | Serious failure | Aircraft control, ABS braking |
| Firm | Result worthless, no disaster | Stock trading quote |
| Soft | Result loses value | Video streaming |
Quick look: real-time deadline types (from page 66)
- Deadline
- Hard
- If missed
- Serious failure
- Example
- Aircraft control, ABS braking
- Deadline
- Firm
- If missed
- Result worthless, no disaster
- Example
- Stock trading quote
- Deadline
- Soft
- If missed
- Result loses value
- Example
- Video streaming
Two-phase commit and failure handling in distributed databases: excerpt from page 61 of the MCA-108 notes
Excerpt from page 61
Commit protocols
A commit protocol ensures atomicity of distributed transactions: all participating sites agree on a single outcome, commit or abort. The most widely used is Two-Phase Commit (2PC); Three-Phase Commit (3PC) avoids some blocking.
Two-Phase Commit (2PC)
Let T be initiated at site Si with coordinator Ci. When all sites inform Ci that T has finished executing, the protocol runs in two phases.
Phase 1, voting or prepare phase. Ci writes <prepare T> in its log, forced to stable storage, and sends PREPARE T to all participating sites. Each participant then decides. If it can commit, it writes <ready T> in its log (forced), along with all of T's log records, and replies READY. If not, it writes <no T> and replies ABORT.
Phase 2, decision or commit phase. If Ci receives READY from all sites, it writes <commit T> (forced) and the transaction is now committed. If any site votes ABORT or a timeout occurs, Ci writes <abort T>. Ci sends the decision to all participants. Each participant records the decision in its log, commits or aborts locally and sends an ACK. After all ACKs arrive, Ci writes <complete T>.
Coordinator Ci Participant Sk
log <prepare T> -- PREPARE T -->
log <ready T> (or <no T>)
<-- READY / ABORT --
all READY? log <commit T> else <abort T>
-- COMMIT / ABORT -->
log decision; release locks
<-- ACK --
log <complete T>Handling failures in 2PC
When a failed participant Sk comes back, its log tells it what to do:
- Log has
<commit T>: Sk executes redo(T). - Log has
<abort T>: Sk executes undo(T). - Log has
<ready T>only: Sk is uncertain and must ask Ci, or other sites, for the decision. - No control record for T: Sk failed before replying, so Ci has aborted T and Sk executes undo(T).
If the coordinator Ci fails, the active sites decide among themselves. If some site has <commit T>, T commits; if some site has <abort T> or has no <ready T>, T aborts. If every active site holds only <ready T>, they must wait for Ci to recover. This is the blocking problem.
MCA-108 exam corner: 48 short-answer and 40 long-answer important questions by unit
Each MCA-108 unit lists 12 short-answer and 10 long-answer important questions; the answers come from that unit's topic pages. The notes label them 2.5 and 12.5 marks, while the 2025-26 pattern gives 12 marks to Q1 and to each unit question.
| Unit | Short-answer | Long-answer | Labelled figures |
|---|---|---|---|
| Unit 1 | 12 | 10 | 6 |
| Unit 2 | 12 | 10 | 6 |
| Unit 3 | 12 | 10 | 4 |
| Unit 4 | 12 | 10 | 10 |
MCA-108 questions and figures per unit
- Unit
- Unit 1
- Short-answer
- 12
- Long-answer
- 10
- Labelled figures
- 6
- Unit
- Unit 2
- Short-answer
- 12
- Long-answer
- 10
- Labelled figures
- 6
- Unit
- Unit 3
- Short-answer
- 12
- Long-answer
- 10
- Labelled figures
- 4
- Unit
- Unit 4
- Short-answer
- 12
- Long-answer
- 10
- Labelled figures
- 10
The MCA-108 notes list 48 short-answer and 40 long-answer important questions across 4 units, plus 26 labelled diagrams.
One exam-style question per unit, with answer pointers:
- Unit 1: R(A, B, C, D, E) with F = {A → BC, CD → E, B → D, E → A}: find candidate keys, the highest normal form and a BCNF decomposition. Pointer: keys A, E, BC and CD; B → D breaks BCNF, but D is prime, so R is in 3NF.
- Unit 2: Explain the CouchDB reduce function, rereduce and grouping. Pointer: a design document with
_countor_stats, thegroup=trueoutput, and why a reducer must accept its own output. - Unit 3: Discuss OODBMS storage issues. Pointer: six headed issues and the swizzling flow from page 48.
- Unit 4: Explain distributed query processing and the semijoin. Pointer: the four phases, then the five semijoin steps and the transfer-cost comparison on page 65.
More practice sits in the MCA-108 important questions.
Who writes and checks the MCA-108 Advanced DBMS notes?
- Prateek Talwar, author: Founder, Unnati Educations; Associate Company Secretary (ACS), ICSI, membership no. 58704, since 15 May 2019; B.Com, University of Delhi (School of Open Learning), 2012. Author profile
- Ritik Rawat, subject reviewer: B.Tech; Senior Full Stack Developer, Unnati Educations. Role on these notes: subject review of the database concepts and the SQL, CouchDB, MongoDB, ODL and XQuery snippets.
The 2026-27 edition of these GGSIPU MCA Semester 2 Advanced DBMS notes is mapped to the MCA scheme approved by the USIC&T Board of Studies on 28/07/2025. It includes CouchDB 3.3 commands, Mango queries and the MongoDB aggregation pipeline for Unit 2. Last checked 13 October 2026 under our editorial policy.
The same team prepares GGSIPU important questions for every course it covers.
Do the MCA-108 notes cover the full GGSIPU syllabus?
Yes. Every topic in the four MCA-108 units of the 2025-26 syllabus has its own section in the notes; the check found no gaps.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| Unit I | Relational Databases: integrity constraints, ER/EER, DBMS comparison, FD and 1NF to 5NF | Part A, topics 1-5, pages 5-12 | Covered |
| Unit I | Query Processing and Optimization: algebra, cost, selection, sorting, join, transformation, indexing | Parts B-C, topics 6-17, pages 13-19 | Covered |
| Unit II | NoSQL Databases: definition, functions, categories | Part A, topics 1-4, pages 23-26 | Covered |
| Unit II | CouchDB: create, store, nest, retrieve, query, views, reduce | Part B, topics 5-11, pages 26-32 | Covered |
| Unit II | MongoDB; Big Data and applications | Parts C-D, topics 12-16, pages 32-36 | Covered |
| Unit III | Object Oriented DBMS: paradigm, architectures, identity, data model, inheritance, extents, storage, OODBMS vs OORDBMS | Parts A-C, topics 1-14, pages 40-49 | Covered |
| Unit III | XML: structure, storage, applications | Part D, topics 15-18, pages 49-53 | Covered |
| Unit IV | Distributed Databases: architectures, storage, transactions, commit protocols, availability, concurrency, recovery, query transformation | Parts A-C, topics 1-10, pages 57-65 | Covered |
| Unit IV | Advanced Transaction Processing (real-time, long duration, nested); advanced database models | Parts D-E, topics 11-19, pages 65-70 | Covered |
MCA-108 official topics mapped to the notes
- Official unit
- Unit I
- Official topics
- Relational Databases: integrity constraints, ER/EER, DBMS comparison, FD and 1NF to 5NF
- Where in the notes
- Part A, topics 1-5, pages 5-12
- Status
- Covered
- Official unit
- Unit I
- Official topics
- Query Processing and Optimization: algebra, cost, selection, sorting, join, transformation, indexing
- Where in the notes
- Parts B-C, topics 6-17, pages 13-19
- Status
- Covered
- Official unit
- Unit II
- Official topics
- NoSQL Databases: definition, functions, categories
- Where in the notes
- Part A, topics 1-4, pages 23-26
- Status
- Covered
- Official unit
- Unit II
- Official topics
- CouchDB: create, store, nest, retrieve, query, views, reduce
- Where in the notes
- Part B, topics 5-11, pages 26-32
- Status
- Covered
- Official unit
- Unit II
- Official topics
- MongoDB; Big Data and applications
- Where in the notes
- Parts C-D, topics 12-16, pages 32-36
- Status
- Covered
- Official unit
- Unit III
- Official topics
- Object Oriented DBMS: paradigm, architectures, identity, data model, inheritance, extents, storage, OODBMS vs OORDBMS
- Where in the notes
- Parts A-C, topics 1-14, pages 40-49
- Status
- Covered
- Official unit
- Unit III
- Official topics
- XML: structure, storage, applications
- Where in the notes
- Part D, topics 15-18, pages 49-53
- Status
- Covered
- Official unit
- Unit IV
- Official topics
- Distributed Databases: architectures, storage, transactions, commit protocols, availability, concurrency, recovery, query transformation
- Where in the notes
- Parts A-C, topics 1-10, pages 57-65
- Status
- Covered
- Official unit
- Unit IV
- Official topics
- Advanced Transaction Processing (real-time, long duration, nested); advanced database models
- Where in the notes
- Parts D-E, topics 11-19, pages 65-70
- Status
- Covered
Official source: MCA scheme and syllabus, A.S. 2025-26 onwards.
Every course in GGSIPU notes is mapped to its official PDF the same way.
How to write MCA-108 answers: normalisation steps, cost formulas, CouchDB views and 2PC message flows
MCA-108 long answers reward clear structure far more than length. The notes' exam tips give a fixed shape for each big question type, and the shapes fit the 12-mark unit questions.
- Normalisation (page 12): list the FDs, find the candidate key by closure, mark prime and non-prime attributes, test each normal form in order, decompose with keys underlined, and state that the result is lossless.
- Join algorithms (page 16): nested-loop pseudo-code, each cost formula, the comparison table, one numerical.
- EER diagrams (page 7): draw the circle with d or o, show total or partial participation, and write inherited attributes in words.
- CouchDB views (page 32): write the design document JSON with both map and reduce, show the
group=trueoutput, and mention rereduce. - 2PC (page 64): both phases with the message-flow figure, the failure table, then the blocking problem and how 3PC removes it.
Worked example: proving a lossless join (page 11)
A common slip in Unit 1 is stopping after the decomposition without proving the lossless join. Using the 2NF case on page 11: STUDENT(Roll, Name) and RESULT(Roll, Course, Grade) share Roll. Since Roll → Name, the common attribute determines all of STUDENT, so (R1 ∩ R2) → R1 holds and the join is lossless.
Q1 is compulsory and spans the whole syllabus, so it rewards breadth. Read the four Quick Revision Tables (pages 20, 37, 54 and 71) the night before; each row is a ready two-line answer, such as "Lossless test: (R1 ∩ R2) → R1 or (R1 ∩ R2) → R2" or "3PC: CanCommit, PreCommit, DoCommit; non-blocking, no partitions".
For short answers, give a one-line definition and one example from the notes, such as _rev for CouchDB revisions or a Datalog ancestor rule for deductive databases. Practise this format on GGSIPU MCA important questions.
MCA-108 and the MCA-168 ADBMS lab, plus other GGSIPU MCA Sem 2 papers
If MCA-108 is your Core Elective-I, the matching practical is MCA-168, the Advanced Database Management Systems Lab (MCA-168 ADBMS lab notes). The official PDF gives this lab outcomes, not a practical list, so here is how the units feed them:
- Lab CO1, ER and EER design → Unit 1, pages 6-7
- Lab CO2 and CO3, NoSQL types and MongoDB commands → Unit 2, pages 24-26 and 33
- Lab CO4, XML attributes, nested queries and XQuery → Unit 3, pages 49-51
The core Semester 2 papers are MCA-102 Data and File Structures, MCA-104 Object Oriented Software Engineering and MCA-106 Python Programming, with labs MCA-162 to MCA-166 and MCA-170 Minor Project-II.
Open Elective-I offers MCA-128 Digital Marketing, MCA-130 Management Information System, MCA-132 Management Principles and Organizational Behavior and MCA-134 Finance and Accounting.
MCA-108 Advanced DBMS notes FAQs
How do I get the full MCA-108 notes?
Send a WhatsApp message to 9899436384 using the "Get Full Notes" button on this page. The full MCA-108 notes come only as a 72-page printed book; they are not sold as a PDF. Delivery takes 5 to 7 days at most, depending on your location. The sample PDF above shows seven pages, one content page per unit, before you order.
What is the passing mark for MCA-108?
MCA-108 is marked out of 100, and its end-term questions add up to 60 marks (a 12-mark Q1 plus four 12-mark unit questions). The MCA scheme of examination states pass marks as 40%, which is 40 out of 100, for every paper. For end-term minimums and re-appear rules, read GGSIPU Ordinance 11 on ipu.ac.in, which governs the programme.
Is MCA-108 compulsory in MCA Semester 2?
No. MCA-108 is one of ten Core Elective-I papers, and students choose any one. The scheme also says an elective needs at least 20 students for classes; with fewer, the institute may still offer it but students complete it through a MOOC such as SWAYAM, with prior approval from the Programme Co-ordination Committee. Ask your institute which electives run.
Which MCA-108 unit needs the most preparation time?
Unit 4 carries 12 teaching hours against 10 for each other unit, and in the notes it has the most topics (19) and the most diagrams (10). Unit 1 is the longest by pages (4 to 21) because normalisation and join costing need worked examples. Plan extra time for 2PC, distributed locking and Unit 1 cost formulas.
Do the MCA-108 notes include CouchDB and MongoDB commands?
Yes. Unit 2 gives CouchDB curl commands for creating a database, inserting, updating and deleting documents, Mango _find queries, and design documents with map and reduce views. The MongoDB section shows mongosh CRUD, an aggregation pipeline, a compound index and the sharded-cluster layout. These snippets also help with the MCA-168 lab outcomes on MongoDB commands.
Do the MCA-108 notes follow the 2025-26 MCA syllabus?
Yes. The MCA-108 notes follow the scheme approved by the USIC&T Board of Studies on 28/07/2025, effective from academic session 2025-26 at affiliated institutes. Every topic in the four official units is mapped to a section and page in the coverage table above. If you joined under an older MCA scheme, compare your own syllabus with that table first.
Get the full MCA-108 Advanced Database Management Systems Notes on WhatsApp
The full MCA-108 Advanced DBMS IPU notes come only as a printed book, ordered on WhatsApp; they are not available as a PDF.
MCA-108 notes book by unit
- Part of the book
- Unit 1
- Pages
- 4-21 (18)
- Topics
- 17
- Important questions
- 12 short + 10 long
- Part of the book
- Unit 2
- Pages
- 22-38 (17)
- Topics
- 16
- Important questions
- 12 short + 10 long
- Part of the book
- Unit 3
- Pages
- 39-55 (17)
- Topics
- 18
- Important questions
- 12 short + 10 long
- Part of the book
- Unit 4
- Pages
- 56-72 (17)
- Topics
- 19
- Important questions
- 12 short + 10 long
Format: a 72-page printed book of Advanced Database Management Systems notes in English, with a Quick Revision Table after every unit. Delivery: within 5 to 7 days at most; the exact time may vary with your location.
Order the MCA-108 notes book on WhatsApp (4 units, 72 pages)
Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.
Ready for the full notes?
Discuss coverage and delivery with our team.