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
DBMS Korth Edition 4 Exercise 12 Question 1 (Page No. 489)
akash.dinkar12
asked
in
Databases
Apr 1, 2019
257
views
0
votes
0
votes
When is it preferable to use a dense index rather than a sparse index ? Explain your answer.
korth
databases
indexing
descriptive
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
257
views
answer
comment
Follow
share this
share
0 Comments
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
4
answers
1
akash.dinkar12
asked
in
Databases
Apr 1, 2019
1,443
views
DBMS Korth Edition 4 Exercise 12 Question 4 (Page No. 489)
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
1.4k
views
korth
databases
indexing
descriptive
0
votes
0
votes
1
answer
2
akash.dinkar12
asked
in
Databases
Apr 1, 2019
328
views
DBMS Korth Edition 4 Exercise 12 Question 3 (Page No. 489)
What is the difference between a primary index and a secondary index ?
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
328
views
korth
databases
indexing
descriptive
0
votes
0
votes
0
answers
3
akash.dinkar12
asked
in
Databases
Apr 1, 2019
316
views
DBMS Korth Edition 4 Exercise 12 Question 2 (Page No. 489)
Since indices speed query processing, why might they not be kept on several search keys ? List as many reasons as possible.
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
316
views
korth
databases
indexing
descriptive
2
votes
2
votes
1
answer
4
akash.dinkar12
asked
in
Databases
Apr 1, 2019
1,455
views
DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
1.5k
views
korth
databases
indexing
b-tree
descriptive
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
