Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
B-tree
hacker16
asked
in
Databases
Jan 30, 2018
363
views
0
votes
0
votes
B tree has minimum space utilization equals to 66.6%.
explain?
databases
b-tree
indexing
hacker16
asked
in
Databases
Jan 30, 2018
by
hacker16
363
views
answer
comment
Follow
share this
share
1 comment
by
hs_yadav
commented
Jan 30, 2018
reply
Follow
share this
i have no idea...about the question but see this..
let consider a node having 100byte order p...
1 byte each ...
p+p-1+p-1=100
p=102/3=34
utilized space would be....
p-1+p-1(key + Dara pointer)/100 =66/100
...66%...
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
bts1jimin
asked
in
Databases
Jan 9, 2019
381
views
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
bts1jimin
asked
in
Databases
Jan 9, 2019
by
bts1jimin
381
views
b-tree
databases
indexing
2
votes
2
votes
2
answers
2
aditi19
asked
in
Databases
Nov 23, 2018
1,629
views
B+ Tree Self Doubt
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
aditi19
asked
in
Databases
Nov 23, 2018
by
aditi19
1.6k
views
b-tree
databases
indexing
multilevel
0
votes
0
votes
1
answer
3
Vishnathan
asked
in
Databases
Aug 24, 2018
8,260
views
B+ tree maximum and minimum height
Vishnathan
asked
in
Databases
Aug 24, 2018
by
Vishnathan
8.3k
views
b-tree
indexing
databases
3
votes
3
votes
1
answer
4
Na462
asked
in
Databases
May 12, 2018
1,422
views
B+ Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. A. B tree index has more levels than B+ tree index for large number of keys. B. B+ tree index has more levels than B ... tree best for sequential access of records. D. B+ tree index nodes more than B+ tree for large number of keys. Please Explain every Point.
Na462
asked
in
Databases
May 12, 2018
by
Na462
1.4k
views
databases
b-tree
indexing
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy