SET - A

Subject Name : 21CS1401-Database Management Systems Marks : 25

Each Question Carry ONE Mark
I. Multiple Choice Questions:
1. To ensure integrity of the data, a database system should follow the ACID properties. What
are these ACID properties?
A) Atomicity, Consistency, Isolation, Durability
B) Accuracy,Consistency,Inclusive,Durability
C)Automicity,Consistency,Inclusive,Durability
D) More than one of the above
Answer: A
2. A schedule in which each transaction is executed atomicity is called a
A) [Link] Schedule
B) Serial Schedule
C) Parallel Schedule
D) None of the above
Answer: B
3. Two concurrent executing transactions T1 and T2 are allowed to update same stock item say
“a” in an uncontrolled manner. In such Scenario. Following problems which occur.
A) Dirty read problem
B) Lost update problem
C) Transaction failure
D) Inconsistent database state

Answer: (A),(B) and (D) only

4. Consider the following databse schedule with two transactions T1 and T2
S=r2(x);r1(X);r2(Y);r1(Y);w2(X);a1;a2
A) S in non-recoverable
B) S is recoverable,but has a cascading abort
C) S does not have a cascading abort
D) S is Strict
Answer: C
5. Which isolation level in DBMS allows a transaction to read committed data and prevents dirty reads,
Burt allows non-repeatable reads?
A) Read Uncommitted
B) Read Committed
C) Repeatable Read
D) Serializable
Answer: D

II. Fill in the Blanks:

1. When a transaction executes all its operaions [Link] is said to be in a ----------------- state.
Answer::Committed
2. The database recovery system ensures that the database is back to it’s -------------- if any of the
checkpoints fail and the transaction reached a failed state.
 Answer: previous consistent state
3. Database recovery module will choose an operation --------------------- after aborting the transaction
Answer: 2
4. The state of all executed transactions is restored to its consistent state if the transaction fails in the -

Answer: Middle
5. The situation in which a transatction holds a data item and waits for the release of data item held by
some other transaction, which in turn waits for another transaction, is called----------------------
Answer: deadlock
III. True or False
1. In order to maintain transactional integrity and database consistency, does a dbms deploy Locks
Answer: True
2. In two-phase locking protocol, a transaction obtains locks in first phase
Answer: False
3. If a transaction obtains a shared lock on a row, it means that the transaction wants to update the row
Answer: True
4. Commit makes permanently recorded transaction in the database.
Answer: True
5. Isolation property is also called as Serializability.
Answer: True
IV. Match the Following
1. Match the following in Serializability
1. conflict seralizability A. transaction only commit
[Link] seralizability B. directed graph conflicts between
operations
3. precedence graph C. serial schedule by swapping non-
conflicting operations
4. recoverable schedule D. the schedule is serializable
transactions read and write
a, 1 - A, 2 - D, 3 - C 4 - B
b, 1 - C, 2 - D, 3 - B, 4 - A
c, 1 - B, 2 - A, 3 - C, 4 - D
d, 1 - D, 2 - C, 3 - B, 2 - A

[Link] the following using ACID properties

[Link] [Link] changes made during the transaction

[Link] properties [Link] transaction processing

[Link] statement [Link] the transaction when can roll back
[Link] [Link] of operations performed single logical unit

a.1)D2)B 3)A.4)C
b. 1)C2)B 3)A.4)D
c.1)A2)B 3)D.4)C
d.1)B2)D 3)A.4)C
 [Link] the following using Transaction command

[Link] A)changes made by one to other transactions

[Link] level B) all changes made during the current
situations
[Link] C) agree commit or rollback the transaction
[Link] commit protocol D) revenged or resolved using timeout
mechanisms

a.1)A2)Aa. 1)B2)A3)D4)A
b.1)B2)A3)D4)A
c.1)B2)C3)D4)A
d.1)B2)A3)D4)A

[Link] the Following using transaction command

[Link] A)concurrent access without conflicts

[Link] protocol B) distributed transaction

[Link] detection C)
concurrent access without conflicts

[Link] rollback D) consistent order of resource acquisition

a.1)A2)A3)D4)B
b.1)B2)A3)D4)A
c.1)C2)B3)D4)A
d.1)B2)A3)D4)A

[Link] the following using schedule

[Link] A)changes made by one to other transactions
[Link] Schedule B) all changes made during the current situations
[Link] C) agree commit or rollback the transaction
mechanism
[Link] command D) revenged or resolved using timeout mechanisms

a.1)A2)A3)D4)B
b.1)B2)A3)D4)A
c.1)B2)C3)D4)A
d.1)B2)A3)D4)A

Short Answers:
1. What is a transaction?
A transaction can be defined as a group of tasks that form a single logical unit.
2. Give the meaning of the expression ACID transaction
(1) Atomicity (2) Consistency (3) Isolation (4) Durability
3. What is meant by serializability? How it is tested?
Serializability is a concept that helps to identify which non serial schedule and find
the transaction equivalent to serial schedule. It is tested using precedence graph
 technique.
4. What is serializable schedule?
The schedule in which the transactions execute one after the other is called serial schedule. It is
consistent in nature. For example : Consider following two transactions T1 and T2
5. Define two phase locking.
Ans.: The two phase locking is a protocol in which there are two phases:
i) Growing Phase (Locking Phase): It is a phase in which the transaction may obtain locks
but does not release any lock.
ii) Shrinking Phase (Unlocking Phase): It is a phase in which the transaction may release
the locks but does not obtain any new lock.

--------------------------
 SET - B
Subject Name : 21CS1401- Database Management Systems
Marks : 25
Each Question Carry ONE Mark

I. Multiple Choice Questions:

1. If a schedule S can be transformed into a schedule S’ by a series of swaps of non-

conflicting instructions, then S and S’ are

A) Non conflict equivalent

B) Equal

C) Conflict equivalent

D) Isolation equivalent

Answer: C

2. If a transaction acquires a shared lock,then it can perform which operation

A) Read

B) Write

C) Read and Write

D) Update

Answer: A

3. Suppose a database schedule S involves transactions T1….[Link] the precedence

graph of S with vertices representing the transactions and edged representing the conflicts.
If S is serializable which one of the following orderings of the vertices of the precedence
graph is guaranteed to yields a serial schedule?

A) Topological order

B) Depth-first order

C) Breadth-first order

D) Ascending order of transaction indices

Answer: A

4. Consider the following schedules involving two transactions.

S1:r1(X);r1(Y);r2(X);r2(Y);w2(Y);w1(X)
S2:r1(X);r2(X);r2(Y);w2(y);r1(Y);w1(X)

Which one of the following statements is correct with respect to above?

A) Both S1 and S2 are conflict serializable

B) Both S1 and S2 are not conflict serializable

C) S1 is conflict serialaizable and S2 is not conflict serializable

D) S1 is not conflict serialaizable and S2 is conflict serializable

Answer: D

5. Which of the following occurs when a transaction cannot proceed for an indefinite
period of time while other transactions in the system continue normally?

A) Starvation

B) Deadlock

C) Wound-Wait

D) Wait-die

Answer: A

II. Fill in the Blanks:

1 Serializability ensures that the outcome of concurrent transactions is equivalent to the outcome
of executing them .

Answer::Serializable

2. concurrency control protocol ensures both conflict serializability and free from
deadlock?

Answer: Time stamp ordering protocol

3. Execution of transaction in isolation the ------------- of a database

Answer: Consistency

4. ---------------------------allows only committed data to be read and further queries that no other
transaction is allowes update it between two reads of a data item by a transaction

Answer: Repeatble Read

5. When is a timestamp allowed---------------------------

 Answer: When execution begins

III. True or False

Concurrency control mechanisms primarily focus on minimizing transaction processing overhead

rather than ensuring data consistency and integrity.

Answer: False

2. Isolation in ACID properties ensures that transactions can interfere with each other's results
during concurrent execution.

Answer: False

3 State in the context of database transactions refers to the current status or condition of a
transaction at any given time.

Answer: True

4. Atomicity ensures that the changes made by a committed transaction are always durable and
permanent.

Answer: False

5. The Timestamp-Based Protocol assigns timestamps to transactions to determine their order of

execution..

Answer: True

V. Match the Following

1. Match the following in transaction locks

1.T1 locks A)One another to release locks on resources

2.T2 locks B)Waiting for each other to release their locks
3.T1 and T2 C)Row A and need Row B to proceed
[Link] D)Row B needs Row A to proceed
a. 1)A2)C3)D4)B
b. 1)C2)D3)B4)A
c. 1)B2)A3)C4)D
d. 1)D2)C3)A4)B

2. Match the following in Timestamp protocols

[Link] A) Ensuring that transactions request resources

in a predefined order.
[Link] detection B) Ensuring that transactions acquire all
required locks at once or checking before
transaction execution if the required resources
are available.
 [Link] ordering C) ransactions wait for a limited time for a
resource and are rolled back if the timeout
expires.
[Link] protocols D) he system regularly checks for deadlocks
and resolves them by aborting one or more
transactions

a. 1)A2)C3)D4)B
b. 1)C2)D3)B4)A
c. 1)B2)A3)C4)D
d. 1)C2)D3)A4)B

3. Match the following in Transaction Isolation Levels

[Link] Read A) when the transaction reads a single row

multiple times and gets a different value on
each Read
[Link]-repeatable Read B) When the two queries are executed, but they
retrieve the two rows differently, at that time,
phantom Read occurs.
[Link] Read C) when a transaction reads the data and that
data has not been committed yet.
[Link] isolation levels D) with the help of isolation, the database can
determine how the transaction integrity is
visible to the system and the user.
a. 1)C2)A3)B4)D
b. 1)C2)D3)B4)A
c. 1)B2)A3)C4)D
d. 1)C2)D3)A4)B

4. Match the following in Transaction Command

1. Read Uncommitted A) The transaction holds read locks on all rows

it references and writes locks on referenced
rows for updates and deletes actions. Since
other transactions cannot read, update or delete
these rows, consequently, it avoids non-
repeatable Read
2. Read committed B) one transaction can not read the changes
made by the other transactions, so it allows
dirty reads.
3. Repeatable Read C) A serializable execution is guaranteed to be
serializable. Serializable execution is defined to
be an execution of operations in which
concurrently executing transactions appears to
be serially executing.
[Link] D) each data that these data gets committed
when these are read by any transaction.
 a. 1)C2)A3)B4)D
b. 1)B2)D3)A4)D
c. 1)B2)A3)C4)D
d. 1)C2)D3)A4)B

5. Match the following in Transaction Seralizability

1. Isolation Level Repeatable Read A) transaction C

2. Isolation Level Read Uncommitted B) transaction A transaction B
3. Solation Level Read Committed C) session ends session begins
4. Isolation Level Serializable D) transaction D
transaction Session ends
a. 1)C2)A3)B4)D
b. 1)B2)D3)A4)D
c. 1)D2)B3)A4)D
d. 1)C2)D3)A4)B

V. Short Answers:

[Link] four conditions for deadlock.

Ans.:

1. Mutual exclusion condition

2. Hold and wait condition

. No preemption condition

Circular wait condition

2. What is meant by log based recovery?

Ans.: Log is a most commonly used data structure for recording the modifications that can be
made to actual database.

Log based recovery is a technique in which a log of each transaction is maintained in some stable
storage so that if failure occurs then it can be recovered from there.

3. List the responsibilities of a DBMS has whenever a transaction is submitted to the system
for execution.

Ans.: The system is responsible for making sure that - (1) Either all the operations in the
transaction are completed successfully and effect is recorded permanently in the database. (2)
The transaction, has no effect whatsoever on the database or on the database or on any other
transaction.

4. what is rigorous two phase locking protocol ?

Ans.: This is stricter two phase locking protocol. Here all locks are to be held until the
transaction commits.

5. What is the difference between shared lock and exclusive lock?

Shared Lock Exclusive Lock

Multiple shared lock can be set on a Only one exclusive lock can be place
transaction simultaneously on a data item at a time.
Shared lock is used for when the Exclusive lock is used when when
transaction wants to perform read the translation wants to perform both
operation read and write operation.
Using shared lock data item can be Using exclusive lock data can be
viewed inserted or deleted

---------------------------
 SET - C

Subject Name : 21CS1401-Database Management Systems Marks : 25

Each Question Carry ONE Mark

I. Multiple Choice Questions:

1. Concurrency control is important for which of the following reason

A) To ensure data integrity when updates occur to the database in a multiple environment

B) To ensure data integrity when updates occur to the database in a Single-user environment

C) To ensure data integrity when reading occur to the database in a multiuser environment

D) To ensure data integrity when updates occur to the database in a single-user environment

Answer: (A)

2. Locking may cause which of the following problems

A) Erroneous updated

B) Deadlock

C) Versioning

D) All of the above

Answer: B

3. Which isolation level in DBMS allows a transaction to read committed data and prevents
dirty reads, Burt allows non-repeatable reads?

A) Read Uncommitted

B) Read Committed

C) Repeatable Read

D) Serializable

Answer: D

4. If a schedule S can be transformed into a schedule S’ by a series of swaps of non-

conflicting instructions, then S and S’ are

A)Conflicting

B)Overwriting
C) Isolated

D)Durable

Answer:A

5. A transaction for which all committed changes are permanent is called

A)atomic

B)consistent

C)Isolated

D)Durable

Ans:D

II. Fill in the Blanks:

1. When a transaction executes all its operaions [Link] is said to be in a -----------------

state.

Answer::Committed

2. The database recovery system ensures that the database is back to it’s -------------- if any of the
checkpoints fail and the transaction reached a failed state.

Answer: previous consistent state

3. Database recovery module will choose an operation --------------------- after aborting the
transaction

Answer: 2

4. The state of all executed transactions is restored to its consistent state if the transaction fails in
the

Answer: Middle

5. The situation in which a transatction holds a data item and waits for the release of data item
held by some other transaction, which in turn waits for another transaction, is called----------------

Answer: deadlock

III. True or False

1. ACID properties ensure the reliability and consistency of transactions in a database system.
Answer: True

2. Serializability guarantees that the result of concurrent execution of transactions is always

equivalent to their sequential execution.

Answer: True

3. Recoverability refers to the ability of a database system to restore data to a consistent state
after a transaction failure.

Answer: True

4. Deadlock handling involves preventing deadlocks from occurring rather than breaking them
once they occur.

Answer: False

5. Locking-based protocols allow multiple transactions to access the same data simultaneously
without any restrictions.

Answer: False

IV. Match the Following

1. Match the following the schedule Ti->Tj

[Link]->Tj A)No Transaction
2. Tj->Ti B) Ti executes write (Q) before Tj executes
write (Q).
3. Ti-=Tj C) Ti executes write (Q) before Tj executes
read (Q).
4. Ti D) Ti executes read (Q) before Tj executes
write (Q).
a. 1)C2)A3)B4)D
b. 1)C2)D3)B4)C
c. 1)B2)A3)C4)D
d. 1)C2)D3)A4)B

2. Match the following the schedule in view seralizability

[Link] (A) A) no subsequent writes

[Link](B) B) no subsequent writes to C
[Link](C) C) no subsequent writes to A,
[Link] D) no subsequent writes to B
a. 1)C2)A3)B4)D
b. 1)C2)D3)B4)C
c. 1)B2)A3)C4)D
d. 1)C2)D3)B4)A

3. Match the following the schedule Serializability

[Link] Read A) must be the same between both the
schedules.
[Link] Read B) view serializable if it is view equivalent to a
serial schedule
[Link] Write C) read of both schedules must be the same
[Link] D) Ti should read A which is updated by Tj
a. 1)C2)D3)A4)B
b. 1)C2)D3)B4)C
c. 1)B2)A3)C4)D
d. 1)C2)D3)B4)A

4. Match the following the recovery system in schedule

1. recovery system A) redo-list, and an undo-list

[Link] point list B)committed
3. <Tn, Start> C) reads log files from the end to start
4. <Tn, commit> D) ransaction is start
a. 1)C2)D3)A4)B
b. 1)C2)A3)D4)B
c. 1)B2)A3)C4)D
d. 1)C2)D3)B4)A

V. Short Answers:

1. Explain the concept of a two-phase commit (2PC) in distributed database systems.

Ans:A two-phase commit is a protocol used to ensure that distributed transactions are either
entirely committed or entirely rolled back, even in the presence of network failures.

2. How does optimistic concurrency control differ from pessimistic concurrency control in
handling concurrent transactions?

Ans: Pessimistic concurrency control uses locks to prevent concurrent access, while optimistic
concurrency control assumes that conflicts are rare and checks for conflicts at the end of a
transaction.

3. What is the READ COMMITTED isolation level, and how does it prevent dirty reads?

Ans: READ COMMITTED ensures that transactions only see committed data. It prevents dirty
reads but may still result in non-repeatable reads and phantom reads.

4. What is the Isolation property in ACID, and why is it important for concurrent database
transactions?

Ans: Isolation ensures that the execution of one transaction is isolated from others, preventing
interference and maintaining data integrity during concurrent access.
5. Explain the concept of a read-write conflict in concurrency control, and how is it
resolved?

Ans: A read-write conflict occurs when one transaction reads data that another transaction is in
the process of modifying. It can be resolved through locking, timestamps, or other mechanisms to
prevent simultaneous access.

=========
 SET - D

Subject Name : 21CS1401-Database Management Systems Marks : 25

Each Question Carry ONE Mark

I. Multiple Choice Questions:

1. Let S be the following schedule of operations of three transactions T!,T2,and T3 in a

relational database system

R2(Y),R1(X),R3(Z),R1(Y),W1(X),R2(Z),W2(Y),R3(X),W3(Z)

Consider the statement P and Q below:

Q:if T3 commits before T! finishes then S is recoverable

Which one of the following choices is correct?

A) P is true and Q is false

B) Both P and Q are true

C) P is false and Q is true

D) Both P and Q are false

Ans:A

2. Recoverability in database transactions refers to the ability to:

A) Recover lost data due to hardware failures

B) Rollback a transaction in case of an error

C) Restore the database to a consistent state after a failure

D) Ensure that committed transactions remain permanently stored

Ans: C

3. rializability in database transactions refers to:

A) The ability to execute transactions one after the other in a sequential order

B) Ensuring that the result of concurrent execution of multiple transactions is the same as
if they were executed serially
C) The process of saving transaction data to a permanent storage medium

D) Allowing transactions to execute in parallel without any restrictions

Ans: B

[Link] the recovery procedure uses the database is immediately updated by transaction
operation during the transaction execution even before the transaction reached its commit
point.

A)write-through

B)deferred write

C)immediate write

D)unbuffered

Ans:A

5. State, in the context of database transactions, refers to:

A) The condition or status of a transaction at any given time.

B) The current data values stored in the database.

C) The number of transactions executed within a certain time frame.

D) The geographical location of the database server.

Ans: A

II. Fill in the Blanks:

1. Isolation in ACID properties ensures that the concurrent execution of transactions does not
each other's results..

Ans:Interfere

2. Concurrency control mechanisms are essential to maintain data consistency and integrity in
environments.

Ans: Multi-user

3. One common strategy for deadlock handling is , where one or more transactions
involved in the deadlock are terminated.

Ans: aborting
4. Locking-based protocols provide mechanisms for managing _, ensuring that
transactions do not interfere with each other's operations.

Ans: contention

5. Deadlocks can occur in locking-based protocols when transactions wait indefinitely for locks
held by other transactions, resulting in a situation.

Ans:deadlock

III. True or False

1. Transactions in a database must always move from one consistent state to another, ensuring
data integrity.

Ans: True

2. The Durability property in ACID transactions ensures that once a transaction is committed, it
will remain so, even in the case of a system failure.

Ans: True

3. Concurrency control mechanisms are not necessary in a single-user database environment.

Ans:True

4. The use of shared and exclusive locks in a locking protocol can completely eliminate the
occurrence of deadlocks.

Ans:False

5. n a timestamp-based protocol, each transaction is assigned a unique timestamp that determines

the order of transaction execution.

Ans: True

IV. Match the Following

[Link] th following using checkpoint in transaction

1. TS(T) < R_TS(X) A) don't execute the W_item(X) operation of

the transaction and continue processing
2. If TS(T) < W_TS(X) B) guarantee of serializability order for the
protocol.
3. W_TS(X) to TS(T) C) T is aborted and rolled back, and operation
is rejected.
4. Thomas write Rule D) If neither condition 1 nor condition 2
occurs, then allowed to execute the WRITE
operation
a. 1)C2)D3)A4)B
 b. 1)C2)A3)D4)B
c. 1)B2)A3)C4)D
d. 1)C2)A3)C4)B

[Link] the following in Default Transaction

A) if database modification occurs while the

1. Deferred database modification
transaction is still active.

B)T ransaction Ti needs to be redone.

2. Immediate database modification:

3. Ti, Start> and <Ti, Commit> C) if the transaction does not modify the
database until it has committed.
4. <Ti, commit> or <Ti, abort> D) Transaction Ti needs to be undone.
a. 1)C2)A3)B4)D
b. 1)C2)A3)D4)B
c. 1)B2)A3)C4)D
d. 1)C2)A3)C4)B

3. Match the following using Validation protocol

1. Read phase: A) f the validation of the transaction is

validated, then the temporary results are
written to the database or system otherwise the
transaction is rolled back.
2. Validation phase: B) It can perform all the write operations on
temporary variables without an update to the
actual database.
3. Write phase: C) t contains the time when Ti finishes its read
phase and starts its validation phase.
4. Write phase: D) the temporary variable value will be
validated against the actual data to see if it
violates the serializability.

a. 1)C2)A3)B4)D
b. 1)B2)D3)A4)C
c. 1)B2)A3)C4)D
d. 1)C2)A3)C4)B

4. Match the following using Validation protocol

1. Start(Ti): A) It contains the time when Ti finishes its read

phase and starts its validation phase.
2. Finish(Ti): B) optimistic concurrency control technique.
3. Validation (Ti): C) It contains the time when Ti started its
 execution
4. Validation Based Protocol D) It contains the time when Ti finishes its
write phase.
a. 1)C2)A3)B4)D
b. 1)B2)D3)A4)C
c. 1)C2)D3)B4)A
d. 1)C2)A3)C4)B

4. Match the following using deadlock avoidance

A) If the resources are allocated in such a way

1. Deadlock Avoidance
that deadlock never occurs, then the deadlock
can be prevented.

2. Deadlock Detection B) When a database is stuck in a deadlock

state, then it is better to avoid the database
rather than aborting or restating the database.
This is a waste of time and resource
C) if a transaction requests for a resource
3. Deadlock Prevention
which is already held with a conflicting lock by
another transaction then the DBMS simply
checks the timestamp of both transactions
D) when a transaction waits indefinitely to
4. Wait-Die scheme
obtain a lock, then the DBMS should detect
whether the transaction is involved in a
deadlock or not.

a. 1)B2)D3)A4)B
b. 1)B2)D3)A4)C
c. 1)C2)D3)B4)A
d. 1)C2)A3)C4)B

V. Short Answers:

1. Describe one method for deadlock prevention in DBMS.

Ans: One common method for deadlock prevention is the Wait-Die scheme. In this method:

1. Each transaction is assigned a unique timestamp when it begins.

2. If a transaction (T1) requests a lock held by another transaction (T2):

 If T1's timestamp is older than T2's, T1 is allowed to wait (Wait).

 If T1's timestamp is newer, T1 is aborted and restarted with the same timestamp
(Die). This approach prevents cyclic waiting, thus avoiding deadlocks.

2. Explain the basic principle of the Two-Phase Locking (2PL) protocol.

Ans:The Two-Phase Locking (2PL) protocol divides the execution of a transaction into two
phases:

1. Growing Phase: A transaction may obtain locks but cannot release any locks.

2. Shrinking Phase: A transaction may release locks but cannot obtain any new locks. This
protocol ensures that once a transaction releases a lock, it cannot obtain any more locks, thus
preserving the consistency and serializability of transactions.

3. How does the Timestamp Ordering protocol ensure serializability?

Ans:The Timestamp Ordering protocol assigns a unique timestamp to each transaction when it
starts. The protocol enforces the following rules to ensure serializability:

1. Read Rule: A transaction can only read an item if the item's last write timestamp is earlier
than the transaction's timestamp.

2. Write Rule: A transaction can only write an item if the item's last read and write timestamps
are earlier than the transaction's timestamp. By following these rules, the protocol ensures that
transactions are executed in a serial order that respects their timestamps.

4. What is the purpose of concurrency control in a DBMS?

Ans:

The purpose of concurrency control in a DBMS is to manage the simultaneous execution of

transactions in a multi-user environment. It ensures that:

 Isolation is maintained between concurrent transactions, preventing them from interfering

with each other.
 Consistency of the database is preserved, preventing issues such as lost updates,
temporary inconsistency, and uncommitted data being read (dirty reads).
 Serializability is achieved, where the outcome of executing transactions concurrently is
the same as if they were executed serially in some order.

5. How do long-running transactions affect data consistency and system performance, and
what strategies can be employed to manage them?

Ans: Long-running transactions can introduce challenges in maintaining data consistency and
may impact system performance. Strategies like distributed checkpointing and transaction
splitting can be used to manage them effectively.