Select the statement that is correct about tree indexing and hash indexing: O B+ tree indexing works well with both exact match and range queries. Hashing indexing is more efficient for exact match than B+ tree indexing when data is not skewed. O B+ tree indexing is more efficient for exact query than Hashing. Hashing indexing work well with both exact match and range queries O B+ tree indexing is more efficient for exact query than Hashing. Hashing indexing is more efficient for range queries than B+ tree indexing

Select the statement that is correct about tree indexing and hash indexing: O B+ tree indexing works well with both exact match and range queries. Hashing indexing is more efficient for exact match than B+ tree indexing when data is not skewed. O B+ tree indexing is more efficient for exact query than Hashing. Hashing indexing work well with both exact match and range queries O B+ tree indexing is more efficient for exact query than Hashing. Hashing indexing is more efficient for range queries than B+ tree indexing

Oracle 12c: SQL

3rd Edition

ISBN:9781305251038

Author:Joan Casteel

Publisher:Joan Casteel

Chapter6: Additional Database Objects

Section: Chapter Questions

Problem 10HOA

See similar textbooks