Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Databases:
Recent questions tagged databases
0
votes
1
answer
151
Confused about cardinality of ER diagram which one is whose cardinality ,look on my notes and clear it out.
Pradeep_Kumar
444
views
Pradeep_Kumar
asked
Jul 13, 2023
Databases
databases
er-diagram
+
–
0
votes
0
answers
152
https://testbook.com/TS-nic-scientist-b/tests/640217b028c19ad10b7fed68?attemptNo=1#/lt-solutions
In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed write(X) successfully and R-t(X) denotes the ... TS(T₁) < W-t(X) then T₁ is rolled back All of the above. PS: Ans given as B
In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed...
_Shubham_.Singh_
239
views
_Shubham_.Singh_
asked
Jul 10, 2023
Databases
transaction-and-concurrency
databases
testbook-test-series
+
–
0
votes
1
answer
153
2NF DECOMPOSITION
ROMITDUTTA
213
views
ROMITDUTTA
asked
Jul 5, 2023
Databases
databases
database-normalization
decomposition
normal-forms
+
–
0
votes
1
answer
154
Database
Considering the following schema, create the appropriate tables and insert at least 5 records: AUTHOR(author-id,name, city,country) PUBLISHER (publisher-id, name,city, country) CATALOG (book-id, title, author-id, publisher-id, category-id, year, price) CATEGORY ( ... in the catalog. (g) Obtain the author and publisher who have published books in more than or 14 equal to 2 categories.
Considering the following schema, create the appropriate tables and insert at least 5 records:AUTHOR(author-id,name, city,country)PUBLISHER (publisher-id, name,city, coun...
gateexplore
901
views
gateexplore
asked
Jun 30, 2023
Databases
sql
relational-algebra
databases
self-doubt
+
–
0
votes
1
answer
155
data base
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows: (a) Four (b) Six (c) Eight
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Cons...
gateexplore
555
views
gateexplore
asked
Jun 30, 2023
Databases
databases
indexing
bplustrees
self-doubt
+
–
0
votes
0
answers
156
#cpcb
Two relations A and B are stored as clustered sequential files on disk. Each block on disk can hold 100 records of either A or B. The relation A contains 1000 records and B contains 500 records. There is a memory buffer to hold only 1 block of each relation. The number of block transfers required to complete a nested loop join operation on these two tables is at least (in integer) _________.
Two relations A and B are stored as clustered sequential files on disk. Each block on disk can hold 100 records of either A or B. The relation A contains 1000 records and...
amit166
222
views
amit166
asked
Jun 30, 2023
Databases
databases
+
–
0
votes
0
answers
157
Databases
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
gateexplore
199
views
gateexplore
asked
Jun 30, 2023
Databases
databases
two-phase-locking-protocol
serializability
+
–
1
votes
2
answers
158
Go class
A database relation has10 attributes {A,BCD,E,F,J} “CDEF” is known to be a candidate key of relation . There may be other candidate keys, which are unknown. What is the maximum number of candidate keys that could simultaneously have?
A database relation has10 attributes {A,BCD,E,F,J} “CDEF” is known to be a candidate key of relation . There may be other candidate keys, which are unknown. What is t...
ayushjain321
711
views
ayushjain321
asked
Jun 29, 2023
Set Theory & Algebra
databases
+
–
1
votes
1
answer
159
Ace Test Series | DBMS
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other lock is allowed. I S I X S SIX X
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other ...
none30
326
views
none30
asked
Jun 16, 2023
Databases
ace-test-series
databases
+
–
0
votes
1
answer
160
Ace Test Series | DBMS
A schedule S is having 3 transactions and each transaction is having two different data items and a blind 'Write A' statement is in all the three transactions.With the above information can you say whether the schedule is ... how many equivalent serial schedules are there serializable and it is equivalent to only two serial schedule detailed schedule is needed
A schedule S is having 3 transactions and each transaction is having two different data items and a blind 'Write A’ statement is in all the three transactions.With the ...
none30
310
views
none30
asked
Jun 16, 2023
Databases
ace-test-series
databases
serializability
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
97
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register