In database indexing, which type of index structure provides the best average-case performance for range queries in modern database systems?
AHash Index
BB+ Tree Index
CBitmap Index
DFull-text Index
Correct Answer:
B. B+ Tree Index
Explanation:
B+ Tree indexes maintain sorted order and support efficient range queries, point queries, and prefix searches. Hash indexes are faster for exact matches but cannot handle range queries efficiently.
Which of the following SQL query optimization techniques is most effective when dealing with large fact tables in a data warehouse environment?
AUsing UNION instead of UNION ALL
BMaterialized views and denormalization
CIncreasing the number of JOINs in queries
DUsing correlated subqueries for filtering
Correct Answer:
B. Materialized views and denormalization
Explanation:
Data warehouses use materialized views to pre-aggregate data and strategic denormalization for faster analytical queries. These techniques significantly improve performance on large fact tables.
iGET uses cookies for essential site functionality, analytics, and ads personalization (via Google AdSense). By clicking "Accept", you consent to our use of cookies.
Privacy Policy ·
Disclaimer