How many times must the hashed index be probed (i.e. accessed) in order to return the result?
Fantastic news! We've Found the answer you've been seeking!
Question:
How many times must the hashed index be probed (i.e. accessed) in order to return the result?
If instead the index was a B+ tree, how many times must the index be probed, starting at the root?
Databases usually contain large amounts of data and a DBMS is required to read data from disk whenever a query is executed. A database index is a data structure that
improves the speed of data retrieval operations by enabling the DBMS to read only a subset of all data from disk when answering a query.
Related Book For
Database management systems
ISBN: 978-0072465631
3rd edition
Authors: Raghu Ramakrishan, Johannes Gehrke, Scott Selikoff
Posted Date: