L3_Indexes高级数据库技术.pdfVIP

Indexes Chapter 10, 11 1 Advanced DB Tech Outlines - structure of the lecture  Tree-structured indexes (from static to “dynamic” tree)  Hash-based indexes (from static to “dynamic” hash)  The Universal B-tree 2 Advanced DB Tech Indexes Sometimes need to retrieve records by the values in one or more fields, e.g.,  Find all students in the “CS” department  Find all students with a gpa 3  An index on a file is a:  Disk-based data structure  Speeds up selections on the search key fields for the index.  Any subset of the fields of a relation can be index search key  Search key is not the same as (candidate) key • (e.g. doesn’t have to be unique).  An index  Contains a collection of index entries and data entries  Supports efficient retrieval of all records with a given search key value k. 3 Advanced DB Tech Tree-Structured Indexes Chapter 10 4 Advanced DB Tech Motivation Suppose every disk page holds 133 records. You are given 1334 = 0.3 billion records. They occupy 1333 = 2.3 million disk pages. You can utilize a small memory buffer of 134 pages. You can build an index structure. Given the key of a record, what is the minimum guaranteed number of disk I/Os to fi