[经济学]INDEXING CHAPTER 12.ppt

Oct 23, 2002 Prof. Ghandeharizadeh INDEXING (CHAPTER 11) TOPICS Basic concepts Hashing B+-tree INTRODUCTION Review Software Architecture of a DBMS Implementation of б Emp table: бSalary=30,000(Employee) Process the select operator using a file scan (linear scan) F1 = Open the file corresponding to Employee P = read first page of F1 While P is not null For each record in P, if the record satisfies the selection predicate then produce as output P = read next page of F1 /* P becomes null when EoF is reached */ Implementation of б Emp table: бSalary=30,000(Employee) Process the select operator using a file scan (linear scan) F1 = Open the file corresponding to Employee P = read first page of F1 While P is not null For each record in P, if the record satisfies the selection predicate then produce as output P = read next page of F1 Implementation of б Emp table: бSalary=30,000(Employee) Process the select operator using a file scan (linear scan) F1 = Open the file corresponding to Employee P = read first page of F1 While P is not null For each record in P, if the record satisfies the selection predicate then produce as output P = read next page of F1 TERMINOLOGY An exact match selection predicate: бSalary=30,000(Employee) , бFirstName=“Shideh”(Employee) A range selection predicate: бSalary30,000(Employee) , бSalary30,000(Employee), бSalary30,000 and Salary 32,000 (Employee) INTRODUCTION (Cont…) Motivation: Speed-up those queries that reference only a small portion of the records in a file. Analogy: Catalog cards in the library (more than one index). Evaluation: 1. Access time (find) 2. Insertion time (find + add) 3. Deletion time (find + delete) 4. Space overhead Search-key: The attribute (or set of attributes) used to lookup records in a file Primary index: The index whose search key specifies the sequential order of the records within a file. Secondary index: The index whose search key does not specify the sequential order of t