Register
Webpage for Databases:

Recent questions tagged databases

1 votes
1 answer
1501
#DBMS FAIL V/S ABORT
what is the difference btw ABORT AND FAIL IN TRANSACTION? PLEASE EXPLAIN WITH A SMALL EXAMPLE!
what is the difference btw ABORT AND FAIL IN TRANSACTION? PLEASE EXPLAIN WITH A SMALL EXAMPLE!
User Avatar
–1 votes
1 answer
1502
# dbms DIRTY READ
Please explain the concept of DIRTY READ In a simplified manner w/ a small example!
Please explain the concept of DIRTY READ In a simplified manner w/ a small example!
User Avatar
0 votes
0 answers
1504
Tuple relational calculus
What does the following tuple relational calculus query produce? • Student (Student_name, street, city) • Score (Student_name, Branch_name, marks) • Branch (Branch_name, HOD) • Manages (Student_name, Faculty_name)
What does the following tuple relational calculus query produce?• Student (Student_name, street, city)• Score (Student_name, Branch_name, marks)• Branch (Branch_nam...
User Avatar
0 votes
0 answers
1505
Tuple relational calculus
Student (Student_name, street, city) • Score (Student_name, Branch_name, marks) • Branch (Branch_name, HOD) • Manages (Student_name, Faculty_name) What does the following tuple relational calculus query produce?
Student (Student_name, street, city)• Score (Student_name, Branch_name, marks)• Branch (Branch_name, HOD)• Manages (Student_name, Faculty_name)What does the followi...
User Avatar
0 votes
1 answer
1506
Nielit
Deadlock does not occurs with single resource why? Is Single resource can't be in shareable mode?
Deadlock does not occurs with single resource why?Is Single resource can't be in shareable mode?
User Avatar
2 votes
1 answer
1507
B+ tree 2
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
User Avatar
2 votes
2 answers
1508
B+ tree
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum...
User Avatar
5 votes
1 answer
1509
#DBMS Blind Write
Please explain the concept of Blind Write in a simplified manner w/ a small example!
Please explain the concept of Blind Write in a simplified manner w/ a small example!
User Avatar
0 votes
1 answer
1510
Doubt in gate 2009 B+-tree question
https://gateoverflow.in/1330/gate2009-44 Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing. Do we split every time a node is full? Even when its siblings have space? Thank You.
https://gateoverflow.in/1330/gate2009-44Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing.Do we split eve...
User Avatar
1 votes
0 answers
1511
Transaction
User Avatar
0 votes
1 answer
1512
Relation Schema
User Avatar
0 votes
0 answers
1516
B TREE
User Avatar
1 votes
0 answers
1517
# FILE AND SQL
User Avatar
0 votes
0 answers
1518
Checkpoints in Data Recovery
Are they in the syllabus? I believe not since nothing is specified in the syllabus but I've seen questions in made easy test series regarding undo and redo list. ... Give contents of Undo and Redo list.
Are they in the syllabus? I believe not since nothing is specified in the syllabus but I've seen questions in made easy test series regarding undo and redo list.$(Start, ...
User Avatar
1 votes
2 answers
1519
lossless join
$R(X,Y,Z,W) is\ decomposed\ into \\ R_1(X,Y)\\ R_2(Y,Z)\\ R_3(Y,W).\\The\ FDs\ are\ :\\ X -> Y,\\ Z->Y,\\ Y->W \\ Find\ whether\ the\ decomposition\ is\ lossless\ or\ lossy\ ?$
$R(X,Y,Z,W) is\ decomposed\ into \\ R_1(X,Y)\\ R_2(Y,Z)\\ R_3(Y,W).\\The\ FDs\ are\ :\\ X - Y,\\ Z->Y,\\ Y->W \\ Find\ whether\ the\ decomposition\ is\ lossless\ or\ ...
User Avatar
0 votes
0 answers
1520
B+ trees
Given a B+ tree, How can we find out their sequence of insertion?
Given a B+ tree, How can we find out their sequence of insertion?
User Avatar
0 votes
0 answers
1521
Ace Test Series: Databases - Sql
User Avatar
0 votes
0 answers
1522
SSC-IMD-2017-04
In order to use a DBMS, it is important to understand A. the physical schema B. all sub-schemas that the system supports C. one subschema D. both (a) and (b) E. None of the above
In order to use a DBMS, it is important to understandA.the physical schemaB.all sub-schemas that the system supportsC.one subschemaD.both (a) and (b)E.None of the above
User Avatar
3 votes
1 answer
1524
2 Phase Locking
Consider the following schedule: S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3 Please explain how it is allowed in 2 PL
Consider the following schedule:S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3Please explain how it is allowed in 2 PL
User Avatar
3 votes
3 answers
1525
VIEW SERIALIZABILITY
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...
User Avatar
3 votes
2 answers
1526
#DBMS What will be the Minimum Number of Tuples?
Say we have two relations R (a,b,c) and S (b,d,e). Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Join)?
Say we have two relations R (a,b,c) and S (b,d,e).Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Joi...
User Avatar
0 votes
1 answer
1529
No. of tables for ER diagram
How many minimum tables are required for this er diagram consisting of a many - many relation and total participation of one of the entities.? Can't i merge relation R and entity B? why?
How many minimum tables are required for this er diagram consisting of a many - many relation and total participation of one of the entities.? Can't i merge relation R an...
User Avatar
0 votes
0 answers
1530
Databases Multiple granularity
User Avatar
Page: