1) Does proper indexing make it possible for some join queries to not need to retrieve a table entry at all to be used effectively in choosing results?  True  False

Programming with Microsoft Visual Basic 2017
8th Edition
ISBN:9781337102124
Author:Diane Zak
Publisher:Diane Zak
Chapter12: Database Queries With Sql
Section: Chapter Questions
Problem 1MQ2
icon
Related questions
Question
1) Does proper indexing make it possible for some join queries to not need to retrieve a table entry at all to be used effectively in choosing results?
 True
 False
 
 
2) Which operation is a Hash based Index optimal for?
 
A) Range matching (ie x >= 10)
 
B) Pattern matching (ie x LIKE "Th%")
 
C) Equality matching (ie x = "This")
 
 
3) A Composite Search Key (ie WHERE age > 10 AND name = "Yossarian") can make use of which indexes with partially matching attribute lists?
(select all that apply)
 
A) Hash index of single key (ie age)
 
B) Hash index of multiple keys (ie age, name, gender)
 
C) B+ Tree index of a single key (ie age)
 
D) B+ Tree index of multiple keys (ie age, name, gender)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Table
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming with Microsoft Visual Basic 2017
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:
9781337102124
Author:
Diane Zak
Publisher:
Cengage Learning
Oracle 12c: SQL
Oracle 12c: SQL
Computer Science
ISBN:
9781305251038
Author:
Joan Casteel
Publisher:
Cengage Learning
A Guide to SQL
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr