[工学]数据结构与算法分析第二版Chapter10.pptVIP

Indexing索引 Goals: Store large files Support multiple search keys Support efficient insert, delete, and range queries Terms(1) Entry sequenced file顺序进入的文件: Order records by time of insertion. Search with sequential search Index file索引文件: Organized, stores pointers to actual records. Could be organized with a tree or other data structure. Entry sequenced files are not practical as an organization for large databases Terms(2) Primary Key主码: A unique identifier for records. May be inconvenient for search. Secondary Key次码: An alternate search key, often not unique for each record. Often used for search key. Linear Indexing 线性索引(1) Linear index: Index file organized as a simple sequence of key/record pointer pairs with key values are in sorted order. Linear indexing is good for searching variable-length变长 records. Linear Indexing (2) If the index is too large to fit in main memory, a second-level index might be used. Inverted List反向表 (1) Inverted list is another term for a secondary index. A secondary key is associated with a primary key, which in turn locates the record. Inverted List 反向表结构(2) Inverted List反向表结构(3) Tree Indexing (1) Linear index is poor for insertion/deletion. Tree index can efficiently support all desired operations: Insert/delete Multiple search keys (multiple indices) Key range search Tree Indexing (2) Difficulties when storing tree index on disk: Tree must be balanced. Each path from root to leaf should cover few disk pages. 2-3 Tree (1) A 2-3 Tree has the following properties: A node contains one or two keys Every internal node has either two children (if it contains one key) or three children (if it contains two keys). All leaves are at the same level in the tree, so the tree is always height balanced. The 2-3 Tree has a search tree property analogous to the BST. 2-3 Tree (2) The advantage of the 2-3 Tree over the BST is that it can be updated at low cost. template class Key, class Elem, class KEComp, class EEComp bool TTTreeKey,