UGC NET CSE | November 2017 | Part 3 | Question: 8

Arjun asked Nov 5, 2017 • edited Jul 4, 2020 by go_editor

726 views

1 votes

Suppose a database schedule S involves transactions $T1, T2, \dots,Tn$. Consider the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?

Topological order
Depth – first order
Breadth – first order
Ascending order of transactions indices

Databases
ugcnetcse-nov2017-paper3
databases
transaction-and-concurrency

+ –

Arjun asked Nov 5, 2017 • edited Jul 4, 2020 by go_editor

Arjun

726 views

See all

1 1 comment

akash.dinkar12

commented Oct 31, 2018

https://gateoverflow.in/39550/gate2016-2-22

It is copy of GATE question

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

using topological order

amit166 answered Oct 26, 2018

amit166

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

2 votes

1 answer

Arjun asked Nov 5, 2017

1,058 views

UGC NET CSE | November 2017 | Part 3 | Question: 7
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $X$, denoted by $r(X)$ and $w(X)$ respectively. Which one of them is conflict serializable? $S1$: $r1(X); r2(X); w1(X); r3(X); w2(X)$ $S2$ : ... $S4$ : $r2(X); w2(X); r3(X); r1(X); w1(X)$ $S1$ $S2$ $S3$ $S4$

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item $X$, denoted by $r(X)$ and $w(X)$ respect...

Arjun

1.1k views

Arjun asked Nov 5, 2017

Databases
ugcnetcse-nov2017-paper3
databases
transaction-and-concurrency

+ –

1 votes

5 answers

Arjun asked Nov 5, 2017

3,472 views

UGC NET CSE | November 2017 | Part 3 | Question: 12
Consider a schema $R(A, B, C, D)$ and following functional dependencies. $A \rightarrow B$ $B \rightarrow C$ $C \rightarrow D$ $D \rightarrow B$ Then decomposition of $R$ ... preserving and lossless join Lossless join but dependency preserving Dependency preserving but not lossless join Not dependency preserving and not lossless join

Consider a schema $R(A, B, C, D)$ and following functional dependencies.$A \rightarrow B$$B \rightarrow C$$C \rightarrow D$$D \rightarrow B$Then decomposition of $R$ into...

Arjun

3.5k views

Arjun asked Nov 5, 2017

Databases
ugcnetcse-nov2017-paper3
databases
relational-schema
rdbms

+ –

1 votes

2 answers

Arjun asked Nov 5, 2017

1,243 views

UGC NET CSE | November 2017 | Part 3 | Question: 11
Given two relations $R_1(A,B)$ and $R_2(C,D)$, the result of following query Select distinct A, B From R1, R2 Is guaranteed to be same as R1 provided one of the following condition is satisfied. $R_1$ has no duplicates and $R_2$ is empty. ... $R_1$ and $R_2$ have no duplicates. $R_2$ has no duplicates and $R_1$ is non - empty.

Given two relations $R_1(A,B)$ and $R_2(C,D)$, the result of following querySelect distinct A, B From R1, R2Is guaranteed to be same as R1 provided one of the following c...

Arjun

1.2k views

Arjun asked Nov 5, 2017

Databases
ugcnetcse-nov2017-paper3
databases
sql

+ –

2 votes

1 answer

Arjun asked Nov 5, 2017

4,611 views

UGC NET CSE | November 2017 | Part 3 | Question: 10
Consider a relation $R (A, B, C, D, E, F, G, H)$ where each attribute is atomic, and following functional dependencies exist. $ CH \rightarrow G$ $A \rightarrow BC$ $B \rightarrow CFH$ $E \rightarrow A$ $F \rightarrow EG$ The relation $R$ is ________ In $1NF$ but not in $2NF$ In $2NF$ but not in $3NF$ In $3NF$ but not in $BCNF$ In $BCNF$

Consider a relation $R (A, B, C, D, E, F, G, H)$ where each attribute is atomic, and following functional dependencies exist.$ CH \rightarrow G$$A \rightarrow BC$$B \righ...

Arjun

4.6k views

Arjun asked Nov 5, 2017

Databases
ugcnetcse-nov2017-paper3
databases
rdbms
database-normalization

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

1 1 comment

0