《数据库系统原理Database System Concepts》双语课件-ch7(Index).pptVIP

2007-6-16 APWeb/WAIM2007 Huang Shan 2007-6-16 APWeb/WAIM2007 Huang Shan 2007-6-16 Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree Index Files Static Hashing Comparison of Ordered Indexing and Hashing Bitmap Index Why should we use index? There are two ways to find the tuples in a table which have a value that we want to search. Scan all tuples in the table: get each tuple in the table, and judge whether the value of the tuple is equal to the searching value. Need more time Named as table scan Why should we use index? Use a catalog to record the value attached with which tuples, so that we only need get the tuples recorded in the catalog. Need less time and can speed up access to desired data But need storage space to store the catalog Named as Index scan Basic Concepts Search Key – the attribute to set of attributes used to look up records in a file. An index file consists of records (called index entries) of the form Index files are typically much smaller than the original file Basic Concepts Index files are typically much smaller than the original file Two basic kinds of indices: Ordered indices: search keys are stored in a sorted order Hash indices: search keys are distributed uniformly across “buckets” using a “hash function”. Index Evaluation Metrics Access types supported efficiently. E.g., records with a specified value in the attribute or records with an attribute value falling in a specified range of values. Access time Insertion time Deletion time Space overhead Ordered Indices In an ordered index, index entries are stored sorted on the search key value. E.g., author catalog in library. Primary index: in a sequentially ordered file, the index whose search key specifies the sequential order of the file. Also called clustering index The search key of a primary index is usually but not necessarily the primary key. Ordered Indices Secondary index: an index whose search key specifies an order diffe