question archive Bus (busNo, bus, price, origin, destination) Assume the following queries are the most common queries in the workload and they are almost equivalent in frequency and importance: Assume that both B+ trees and hashed indexes are supported by the DBMS and that both single and multiple-attribute index search keys are permitted
Bus (busNo, bus, price, origin, destination) Assume the following queries are the most common queries in the workload and they are almost equivalent in frequency and importance: Assume that both B+ trees and hashed indexes are supported by the DBMS and that both single and multiple-attribute index search keys are permitted
Subject:Computer SciencePrice: Bought3
Bus (busNo, bus, price, origin, destination)
Assume the following queries are the most common queries in the workload and they are almost equivalent in frequency and importance:
Assume that both B+ trees and hashed indexes are supported by the DBMS and that both single and multiple-attribute index search keys are permitted.
For each of the following queries, decide a most efficient index. Specify the attributes you recommend indexing on, indicating whether each index should be clustered or unclustered and whether it should be a B+ tree or a hashed index.
Note: If you can search with an index-only plan you should create composite search key.
1. SELECT * FROM Bus B WHERE B.bus = 500
2. SELECT * FROM Bus B WHERE B.price > 5000
3. SELECT bus, count (*)
FROM Bus WHERE price < 2000
GROUP BY Bus
