GATE DA Database Management & Warehousing Previous Year Questions

23 solved GATE DA questions on Database Management & Warehousing, drawn from 3 exam years and grouped by year. Every question shows the official answer and a step-by-step solution.

Want to practise this topic and ask follow-up questions? Explore Success Tracker.

Revision companion

Database Management & Warehousing: state the schema before querying

Record the schema, functional dependencies, or ER structure before choosing a rule or writing a query. SQL semantics depend on duplicate handling, NULL behavior, and grouping rules. Data warehousing questions require distinguishing facts from dimensions. These selected foundations connect the relational model, normalization, SQL, and warehousing concepts. They are not a complete syllabus.

Our study notes and original examples support the PYQs below; they are not official exam questions or a replacement for the current syllabus.

Before you start

  • Sets, subsets, Cartesian products, and basic propositional logic.
  • Relations, tuples, attributes, and simple SELECT-FROM-WHERE queries.

Concepts to revise before solving

Relational model and ER diagrams

An entity set maps to a table; each relationship becomes either a table or foreign keys depending on cardinality. A weak entity's key includes its owner's key. Map total participation as a NOT NULL foreign key. Read the cardinality ratio and participation constraints before converting an ER diagram to tables.

Check yourself: Does your relational schema preserve every entity, relationship, and key constraint from the ER diagram?

Functional dependencies and normalization

Compute the attribute closure X⁺ by starting with X and repeatedly applying dependencies. X is a superkey when X⁺ contains all attributes; a candidate key has no proper subset that is also a superkey. BCNF requires every nontrivial determinant to be a superkey. A partial dependency of a non-prime attribute on a proper subset of a candidate key violates 2NF.

Check yourself: Can removing one attribute from your proposed key still determine every attribute?

SQL aggregation and join semantics

SQL bags retain duplicates; relational algebra uses sets. A JOIN can multiply rows when multiple matches exist. GROUP BY partitions rows; HAVING filters groups after aggregation. COUNT(column) ignores NULLs; COUNT(*) counts all rows. A LEFT JOIN retains every row from the left table, padding with NULLs where no match exists.

Check yourself: Can you enumerate the rows produced by the JOIN before applying GROUP BY?

Transactions and concurrency control

A schedule is conflict-serializable when its precedence graph (one vertex per transaction, edges for conflicting operation orderings) is acyclic. Two operations conflict when they access the same item and at least one writes. A topological sort of the acyclic graph gives an equivalent serial order. Recoverability is a separate property.

Check yourself: Have you excluded read-read pairs and checked every shared data item?

Data warehousing: star schemas and OLAP

A star schema centers a fact table holding measures and foreign keys to dimension tables. Dimensions describe the who, what, where, and when; facts record quantitative measures. Roll-up aggregates along a dimension hierarchy (e.g., day to month); drill-down disaggregates. Slice fixes one dimension; dice restricts multiple dimensions.

Check yourself: Is each column in the fact table a measure or a foreign key, not a descriptive attribute?

Mistakes to avoid

Inferring a functional dependency from sample rows.
A dependency constrains all legal instances; sample data can refute it but cannot establish it.
Placing descriptive attributes in the fact table instead of a dimension table.
Fact tables store measures and foreign keys. Product name, category, and similar descriptions belong in a dimension table.
Assuming a LEFT JOIN produces the same row count as an INNER JOIN.
A LEFT JOIN retains unmatched left-table rows with NULL-padded right columns, potentially producing more rows than an INNER JOIN.

Original teaching example · not a PYQ

Work through the reasoning

Original mini-example: R(A, B, C, D) has functional dependencies A → B and BC → D. Find all candidate keys and the highest normal form among 1NF, 2NF, 3NF, and BCNF.

  1. No dependency produces A or C, so every candidate key must contain both A and C.
  2. Compute {A, C}⁺: A → B gives {A, B, C}; BC → D gives {A, B, C, D}. So AC is a superkey.
  3. Neither {A} nor {C} alone determines all attributes. AC is a candidate key, and it is the only one.
  4. Check 2NF: A is a proper subset of key AC, and A → B where B is non-prime. This is a partial dependency, violating 2NF. The highest normal form is 1NF.

Candidate key: {A, C}. Highest normal form: 1NF (violated by the partial dependency A → B).

Try it before reading the answer

Separate original check: in a star schema, a fact table Sales has foreign keys to dimension tables Date, Product, and Store. Date has 365 rows, Product has 100 rows, and Store has 50 rows. What is the maximum number of distinct fact rows if no combination of dimension keys is repeated?

Show answer and reasoning

1,825,000 rows.

Each fact row corresponds to a unique (Date, Product, Store) combination. The maximum is 365 × 100 × 50 = 1,825,000. Actual data may be sparse, but this is the upper bound when every combination is permitted exactly once.

Go deeper with free learning resources

Supplemental reading, not an official GATE reading list or an endorsement of these notes.

  • Database System Concepts: chapter slides

    Free supplemental slides from the textbook authors covering the relational model, SQL, normalization, ER diagrams, transactions, and data warehousing. Revisit the relevant chapter after attempting practice questions.

Apply this to the previous-year questions

Previous-year questions by year

This page shows 23 recent questions from the released archive, newest first. For older questions and complete papers, browse all GATE DA papers. Questions can carry more than one subject tag; counts are not marks weightage.

GATE DA 202611 questions

  1. Set 1 Q17Let R(A,B,C,D,E)\text{Let } R(A,B,C,D,E) be a relational schema with functional dependency set F={ABC,CDE,EA}F=\{A \rightarrow BC, CD \rightarrow E, E \rightarrow A\}. Which of the…MCQ · +1 marks · Easy
  2. Set 1 Q18Consider that the visualization of a 3-dimensional data cube is showing Sales Quantity for each combination of the attributes Product Type, Month and…MCQ · +1 marks · Easy
  3. Set 1 Q26Consider two relations r and s defined on the relational schemas R(A,B) and S(E,C), respectively. A is the primary key of R and E is a foreign key of S…MSQ · +1 marks · Easy
  4. Set 1 Q32In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data…NAT · +1 marks · Medium
  5. Set 1 Q41Consider a B+ Tree where the maximum number of key values in each leaf node is 2 and the maximum number of pointers in each non-leaf node is 3. Let the content…MCQ · +2 marks · Medium
  6. Set 1 Q42Consider the given relations XX, YY and ZZ. The relation XX has three columns PP, QQ and RR. The relation YY has three columns PP, QQ and SS. The…MCQ · +2 marks · Medium
  7. Set 1 Q43Consider the concept hierarchies as shown in the figure. Which of the following options denotes the total number of possible data cuboids from these concept…MCQ · +2 marks · Easy
  8. Set 1 Q51Consider a table Employee(EmpID, TeamID), where the column EmpID (ID of an employee) is the primary key. The column TeamID denotes the team ID of the…MSQ · +2 marks · Medium
  9. Set 1 Q59Let there be two relations XX and YY as shown. XX has three columns PP, QQ and RR. YY has two columns PP and SS. Relation XX | PP | QQ | RR |…NAT · +2 marks · Medium
  10. Set 1 Q60Let Account be a relation as shown. Account | AccNo | Balance | |-------|---------| | A1 | 5000 | | A2 | 5000 | | A3 | 10000 | | A4 | 15000 | | A5 |…NAT · +2 marks · Medium
  11. Set 1 Q61Consider an ER model with the entities E1(A11,A12,A13)E1(A_{11}, A_{12}, A_{13}) and E2(A21,A22,A23)E2(A_{21}, A_{22}, A_{23}), where, A11,A12,A13A_{11}, A_{12}, A_{13} are the attributes of…NAT · +2 marks · Medium

GATE DA 20257 questions

  1. Set 1 Q16If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to…MCQ · +1 marks · Medium
  2. Set 1 Q17Consider the following three relations: Car (model, year, serial, color) Make (maker, model) Own (owner, serial) A tuple in Car represents a specific…MCQ · +1 marks · Easy
  3. Set 1 Q33On a relation named Loan of a bank: Loan | loan_number | branch_name | amount | |---|---|---| | L11 | Banjara Hills | 90000 | | L14 | Kondapur | 50000…NAT · +1 marks · Easy
  4. Set 1 Q46Consider a fact table in an OLAP application: Facts(D1, D2, val), where D1 and D2 are its dimension attributes and val is a dependent attribute.…MCQ · +2 marks · Medium
  5. Set 1 Q56Consider the following two relations, named Customer and Person, in a database: [code] Which of the following statements is/are correct?MSQ · +2 marks · Easy
  6. Set 1 Q57Consider a database relation R with attributes ABCDEFG, and having the following functional dependencies: ABCEFEDGBCAA \to BCEF \qquad E \to DG \qquad BC \to A Which…MSQ · +2 marks · Medium
  7. Set 1 Q62Consider the following tables, Loan and Borrower, of a bank. Loan | loan_num | branch_name | amount | | :--- | :--- | :--- | | L11 | Banjara Hills…NAT · +2 marks · Medium

GATE DA 20245 questions

  1. Set 1 Q26Consider a database that includes the following relations: Defender(name, rating, side, goals) Forward(name, rating, assists, goals)…MCQ · +1 marks · Easy
  2. Set 1 Q27Let the minimum, maximum, mean and standard deviation values for the attribute income of data scientists be ₹46000, ₹170000, ₹96000, and ₹21000,…MCQ · +1 marks · Easy
  3. Set 1 Q31Consider the following two tables named Raider and Team in a relational database maintained by a Kabaddi league. The attribute ID in table **Team**…NAT · +1 marks · Easy
  4. Set 1 Q46Given the relational schema R=(U,V,W,X,Y,Z)R = (U, V, W, X, Y, Z) and the set of functional dependencies: {UV,UW,WXY,WXZ,VX}\{U \to V, U \to W, WX \to Y, WX \to Z, V \to X\} Which of the…MSQ · +2 marks · Medium
  5. Set 1 Q55An OTT company is maintaining a large disk-based relational database of different movies with the following schema: Movie(ID, CustomerRating)…MSQ · +2 marks · Medium

Other GATE DA topics

Continue learning with Success Tracker

Keep working on Database Management & Warehousing

Reading a solution is a useful start. In Success Tracker, you can attempt questions yourself, review mistakes and return to the topics that need another pass.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.