Scribd
Upload
27 views2 pages

Understanding SQL, JDBC, and Transactions

The document covers various topics related to database management, including transitive dependency, SQLJ, JDBC, and functional dependencies with examples. It also discusses transaction execution states, ACID properties, locking protocols, and serializability in detail. Additionally, it includes exercises on determining candidate keys and analyzing transaction schedules for serializability.

Uploaded by

Supriya Uppar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
27 views2 pages

Understanding SQL, JDBC, and Transactions

The document covers various topics related to database management, including transitive dependency, SQLJ, JDBC, and functional dependencies with examples. It also discusses transaction execution states, ACID properties, locking protocols, and serializability in detail. Additionally, it includes exercises on determining candidate keys and analyzing transaction schedules for serializability.

Uploaded by

Supriya Uppar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

MODULE 4

Demonstrate transitive dependency? Give an example?


With an suitable explain Informal Design Guidelines for Relation Schemas
What is SQLJ? How it is different from JDBC.
Explain in brief SQLJ.
Explain about Loss less-join dependency?
Explain JDBC classes and interfaces.
Define Armstrong axioms for FD’s?
With an suitable example, explain Properties of Relational Decompositions
Determine the closer of the following set of functional dependencies for a relation scheme
R(A,B,C,D,E,F,G,H), F={ AB→C, BD→EF, AD→G, A→H} List the candidate keys of R.
Determine the closer of the following set of functional dependencies for a relational scheme
R (A,B,C,D,E) ,F= {A͢͢͢͢ →BC, CD→E, B→D, E→A}. List out the candidate keys of R.
Determine the closer of the following set of functional dependencies for a relational scheme
R(A,B,C,D) and FDs {AB → C, C → D, D → A}. List out the candidate keys of R.
Explain the architecture of JDBC main components and types of drives

MODULE 5
1. With the help of transition [Link] the states of transaction execution.
2. Explain with example ACID properties?
3. Discuss the characterizing schedules based on recoverability
4. Describe Granularity of data items and Multiple Granularity locking.
5. Explain in detail about the two-phase locking protocol?
6. Explain in detail about Lock-Based Protocols?
7. Explain in detail about Validation-Based Protocols?
8. Explain in detail about Serializability?
9. Explain in detail about Timestamp-Based Protocols?
10. What is transaction? Explain the ACID Properties of transactions?
11. Briefly discuss on the two phase locking protocol used in concurrency control. How
does it gurantees serializability.
12. Explain multi version concurrency control protocols.
13. Briefly explain Transaction Support in SQL.
14. Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given
below. Draw the serializability (precedence) graphs for S1 and S2, and state whether
10 18CS53 each schedule is serializable or not. If a schedule is serializable, write
down the equivalent serial schedule(s). T1: r1 (X); r1 (Z); w1 (X);
T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);
T3: r3 (X); r3 (Y); w3 (Y); S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y);
r2 (Y); w2 (Z); w2 (Y); S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2
(Z); w3 (Y); w2 (Y);

You might also like