DBMS-8

thor asked Jan 7, 2017

321 views

0 votes

thor asked Jan 7, 2017

thor

321 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

2 votes

B . B+ Trees

Both B and B+ trees leaves elements are at same level which makes O(log n) time to search any element

But in B+ trees all the key entries/index are stored only in leaves ,so path to find the any element in B+ trees is of same length

Prajwal Bhat answered Jan 7, 2017 • edited Jan 7, 2017 by Prajwal Bhat

Prajwal Bhat

See all

2 2 Comments

thor

commented Jan 7, 2017

Ans given is (B), what does path mean?

0 votes

Prajwal Bhat

commented Jan 7, 2017

check now!

0 votes

Please log in or register to add a comment.

0 votes

Answer : Option (B)B+Tree

Jason GATE answered Jan 7, 2017

Jason GATE

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 answers

akash.dinkar12 asked Apr 1, 2019

430 views

DBMS Korth Edition 4 Exercise 16 Question 8 (Page No. 633)
Consider the following extension to the tree-locking protocol, which allows both shared and exclusive locks: $ $ A transaction can be either a read-only transaction, in which case it can request only shared locks, ... , whereas update transactions must lock the root first. Show that the protocol ensures serializability and deadlock freedom.

Consider the following extension to the tree-locking protocol, which allows both shared and exclusive locks:$•$ A transaction can be either a read-only transaction, in ...

akash.dinkar12

430 views

akash.dinkar12 asked Apr 1, 2019

Databases
korth
databases
transaction-and-concurrency
descriptive

+ –

0 votes

0 answers

akash.dinkar12 asked Apr 1, 2019

339 views

DBMS Korth Edition 4 Exercise 15 Question 8 (Page No. 589)
Consider the following two transactions: $T_1:$ $read(A);$ $read(B);$ $if A = 0$ $then$ $B := B + 1;$ $write(B);$ $T_2:$ $read(B);$ $read(A);$ $if B = 0$ $then$ $A := A + 1;$ ... $T_1$ and $T_2$ that produces a nonserializable schedule. $c$. Is there a concurrent execution of $T_1$ and $T_2$ that produces a serializable schedule ?

Consider the following two transactions:$T_1:$ $read(A);$ $read(B);$ $if A = 0$ $then$ $B := B + 1;$ $write(B);$$T_2:$ $read(B);$ ...

akash.dinkar12

339 views

akash.dinkar12 asked Apr 1, 2019

Databases
korth
databases
transaction-and-concurrency
descriptive

+ –

0 votes

0 answers

ajaysoni1924 asked Mar 28, 2019

284 views

DBMS Korth Edition 6 Exercise 7 Question 8 (Page No. 317)
Consider a relation such as sec_course, generated from a many-to-one relationship sec_course. Do the primary and foreign key constraints created on the relation enforce the many-to-one cardinality constraint? Explain why.

Consider a relation such as sec_course, generated from a many-to-one relationshipsec_course. Do the primary and foreign key constraints created onthe relation enforce the...

ajaysoni1924

284 views

ajaysoni1924 asked Mar 28, 2019

Databases
databases
korth-edition6
database-design
er-diagram
descriptive

+ –

1 votes

1 answer

ajaysoni1924 asked Mar 26, 2019

1,768 views

DBMS Korth Edition 6 Exercise 6 Question 8 (Page No. 251)
Consider the relational database given below where the primary keys are underlined. Give an expression in tuple relational calculus for each of the following queries: a. Find all employees who work directly for Jones. b. Find all ... works (person name, company name, salary) company (company name, city) manages (person name, manager name)

Consider the relational database given below where the primary keys areunderlined. Give an expression in tuple relational calculus for each of thefollowing queries:a. Fin...

ajaysoni1924

1.8k views

ajaysoni1924 asked Mar 26, 2019

Databases
databases
korth-edition6
relational-model
relational-algebra
relational-calculus
tuple-relational-calculus

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

2 2 Comments reply

Please log in or register to add a comment.

Answer : Option (B)B+Tree

0 reply

Please log in or register to add a comment.

Related questions

0

2 2 Comments

0