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
self doubt
newdreamz a1-z0
asked
in
Databases
Jan 2, 2019
383
views
1
vote
1
vote
For range queries every B+ tree index requires less I/O than a full table scan.
can anyone explain?
databases
b-tree
tree
newdreamz a1-z0
asked
in
Databases
Jan 2, 2019
by
newdreamz a1-z0
383
views
answer
comment
Follow
share this
share
1 comment
by
smsubham
commented
Jan 26, 2020
reply
Follow
share this
We can to leaf node from where our range begins. Then with each block access (remember leaf has pointer to next leaf in B+ tree) we can handle the range queries. So we don't have to scan entire table.
0
0
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
1
vote
1
vote
2
answers
1
Shivani gaikawad
asked
in
Databases
Oct 27, 2018
279
views
DBMS basic test1
Shivani gaikawad
asked
in
Databases
Oct 27, 2018
by
Shivani gaikawad
279
views
databases
b-tree
tree
0
votes
0
votes
1
answer
2
iarnav
asked
in
Databases
Dec 15, 2017
1,179
views
B+ Tree Question
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
iarnav
asked
in
Databases
Dec 15, 2017
by
iarnav
1.2k
views
b-tree
bplustrees
databases
indexing
tree
1
vote
1
vote
1
answer
3
Tuhin Dutta
asked
in
Databases
Nov 30, 2017
620
views
B+ tree
Assume a system has following parameters to construct a B+ tree. The specification of the tree are: • Size of search key is 15 B • Size of block is 512 B • Size of record pointer is 9 B • Size of block pointer is 8 B The maximum number of keys that can be accommodated in each non-leaf node of the tree is ________.
Tuhin Dutta
asked
in
Databases
Nov 30, 2017
by
Tuhin Dutta
620
views
databases
b-tree
tree
5
votes
5
votes
1
answer
4
firki lama
asked
in
Databases
Jan 15, 2017
5,277
views
order of leaf node in b+ tree??
which formula should we use for calculating LEAF node in B+ tree? I. n*(K+r)+b<=block size where n=no of keys k=key size,r=record pointer,b=block pointer II. (n-1)(K+r)+b<=block size
firki lama
asked
in
Databases
Jan 15, 2017
by
firki lama
5.3k
views
databases
b-tree
tree
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy