1. Database Management Systems, R. Ramakrishnan and J. Gehrke1 File Organizations and Indexing Chapter 8 Jianping Fan Dept of Computer Science UNC-Charlotte

2. Database Management Systems, R. Ramakrishnan and J. Gehrke2 How to organize files in disk will affect the performance of database! File Storage Disk Buffer (RAM) Data Page I/O cost

3. Database Management Systems, R. Ramakrishnan and J. Gehrke3 Description Schema attribute Primary Key Candidate Key Search Key Why we do not always use primary key as the search key? How client access the file will also affect the performance of database!

4. Database Management Systems, R. Ramakrishnan and J. Gehrke4 Alternative File Organizations Many alternatives exist, each ideal for some situation, and not so good in others: – Heap files: Suitable when typical access is a file scan retrieving all records. – Sorted Files: Best if records must be retrieved in some order, or only a `range’ of records is needed. – Hashed Files: Good for equality selections. u File is a collection of buckets. Bucket = primary page plus zero or more overflow pages. u Hashing function h : h ( r ) = bucket in which record r belongs. h looks at only some of the fields of r, called the search fields.

5. Database Management Systems, R. Ramakrishnan and J. Gehrke5 We can sort the objects with only one attribute! Heap files Attributes objects Sorted files Attributes objects name Search key

6. Database Management Systems, R. Ramakrishnan and J. Gehrke6 Hash files Attributes Hash function buckets attribute Search key 20% empty We can hash the objects based on only one attribute!

7. Database Management Systems, R. Ramakrishnan and J. Gehrke7 Disk Cost Model for Our Analysis I/O cost Different file organization techniques may suit for different operations!

8. Database Management Systems, R. Ramakrishnan and J. Gehrke8 Cost of Operations * Several assumptions underlie these (rough) estimates!

9. Database Management Systems, R. Ramakrishnan and J. Gehrke9 Cost Model for Our Analysis We include/ignore CPU cost analysis: – B: The number of data pages – R: Number of records per page – D: (Average) time to read or write disk page – Measuring number of page I/O’s ignores gains of pre-fetching blocks of pages; thus, even I/O cost is only approximated. – Average-case analysis; based on several simplistic assumptions. C: Data Matching time, H: Hashing time

10. Database Management Systems, R. Ramakrishnan and J. Gehrke10 Assumptions in Our Analysis v Single record insert and delete. v Heap Files: – Equality selection on key; exactly one match. – Insert always at end of file. v Sorted Files: – Files compacted after deletions. – Selections on sort field(s). v Hashed Files: – No overflow buckets, 80% page occupancy.

11. Database Management Systems, R. Ramakrishnan and J. Gehrke11 Cost of Operations Heap files Attributes objects Sorted files Attributes objects name If search key is same as the attribute for sorting!

12. Database Management Systems, R. Ramakrishnan and J. Gehrke12 Cost of Operations OperationsHeap File Sorted File Scan B(D+RC) Equal Search 0.5B(D+RC) Range Search B(D+RC) Insert 2D + RC Delete D + 0.5B(D+RC) B(D+RC) DlogB + ClogR (DlogB+ClogR)+D*N (DlogB+ClogR)+B(D+RC) Cost for re-organization! If not just put it at the end!

13. Database Management Systems, R. Ramakrishnan and J. Gehrke13 Cost of Operations Hash files Attributes Hash function buckets attribute Search Key First use the search key to find the Bucket, and the scan the data in that page. 20% empty h = a*value + b mod n

14. Database Management Systems, R. Ramakrishnan and J. Gehrke14 Cost of Operations Operations Hash File Scan 1.25B(D+RC) Equal Search H+D+0.5RC Range Search 1.25B(D+RC) Insert C+D+(H+D+0.5RC) Delete (20% empty) (H+D+0.5RC)+ (C+D)

15. Database Management Systems, R. Ramakrishnan and J. Gehrke15 Cost of Operations How to choose file organization? Only concern I/O cost!

16. Database Management Systems, R. Ramakrishnan and J. Gehrke16 What is the Database? Database Indexing Data Storage Management Database Management a. File management b. Indexing tree Database indexing is stored in main memory with several pages Buffer pool I/O cost

17. Database Management Systems, R. Ramakrishnan and J. Gehrke17 Alternatives for Data Entry k* in Index v Three alternatives: À Data record with key value k Á Â v Choice of alternative for data entries is orthogonal to the indexing technique used to locate data entries with a given key value k. – Examples of indexing techniques: B+ trees, hash- based structures – Typically, index contains auxiliary information that directs searches to the desired data entries

18. Database Management Systems, R. Ramakrishnan and J. Gehrke18 Indexes v An index on a file speeds up selections on the search key fields for the index. – Any subset of the fields of a relation can be the search key for an index on the relation. – Search key is not the same as key (minimal set of fields that uniquely identify a record in a relation). v An index contains a collection of data entries, and supports efficient retrieval of all data entries k* with a given key value k.

19. Database Management Systems, R. Ramakrishnan and J. Gehrke19 Indexes How to build database indexing tree? Root table

20. Database Management Systems, R. Ramakrishnan and J. Gehrke20 Alternatives for Data Entries (Contd.) v Alternative 1: – If this is used, index structure is a file organization for data records (like Heap files or sorted files). – At most one index on a given collection of data records can use Alternative 1. (Otherwise, data records duplicated, leading to redundant storage and potential inconsistency.) – If data records very large, # of pages containing data entries is high. Implies size of auxiliary information in the index is also large, typically.

21. Database Management Systems, R. Ramakrishnan and J. Gehrke21 Alternatives for Data Entries (Contd.) v Alternatives 2 and 3: – Data entries typically much smaller than data records. So, better than Alternative 1 with large data records, especially if search keys are small. (Portion of index structure used to direct search is much smaller than with Alternative 1.) – If more than one index is required on a given file, at most one index can use Alternative 1; rest must use Alternatives 2 or 3. – Alternative 3 more compact than Alternative 2, but leads to variable sized data entries even if search keys are of fixed length.

22. Database Management Systems, R. Ramakrishnan and J. Gehrke22 Index Classification v Primary vs. secondary : If search key contains primary key, then called primary index. – Unique index: Search key contains a candidate key. v Clustered vs. unclustered : If order of data records is the same as, or `close to’, order of data entries, then called clustered index. – Alternative 1 implies clustered, but not vice-versa. – A file can be clustered on at most one search key. – Cost of retrieving data records through index varies greatly based on whether index is clustered or not!

23. Database Management Systems, R. Ramakrishnan and J. Gehrke23 Clustered vs. Unclustered Index v Suppose that Alternative (2) is used for data entries, and that the data records are stored in a Heap file. – To build clustered index, first sort the Heap file (with some free space on each page for future inserts). – Overflow pages may be needed for inserts. (Thus, order of data recs is `close to’, but not identical to, the sort order.) Index entries Data entries direct search for (Index File) (Data file) Data Records data entries Data entries Data Records CLUSTERED UNCLUSTERED

24. Database Management Systems, R. Ramakrishnan and J. Gehrke24 Index Classification (Contd.) v Dense vs. Sparse : If there is at least one data entry per search key value (in some data record), then dense. – Alternative 1 always leads to dense index. – Every sparse index is clustered! – Sparse indexes are smaller; however, some useful optimizations are based on dense indexes. Ashby, 25, 3000 Smith, 44, 3000 Ashby Cass Smith 22 25 30 40 44 50 Sparse Index on Name Data File Dense Index on Age 33 Bristow, 30, 2007 Basu, 33, 4003 Cass, 50, 5004 Tracy, 44, 5004 Daniels, 22, 6003 Jones, 40, 6003

25. Database Management Systems, R. Ramakrishnan and J. Gehrke25 Index Classification (Contd.) v Composite Search Keys : Search on a combination of fields. – Equality query: Every field value is equal to a constant value. E.g. wrt index: u age=20 and sal =75 – Range query: Some field value is not a constant. E.g.: u age =20; or age=20 and sal > 10 v Data entries in index sorted by search key to support range queries. – Lexicographic order, or – Spatial order. sue1375 bob cal joe12 10 20 8011 12 nameagesal 12,20 12,10 11,80 13,75 20,12 10,12 75,13 80,11 11 12 13 10 20 75 80 Data records sorted by name Data entries in index sorted by Data entries sorted by Examples of composite key indexes using lexicographic order.

26. Database Management Systems, R. Ramakrishnan and J. Gehrke26 Summary v Many alternative file organizations exist, each appropriate in some situation. v If selection queries are frequent, sorting the file or building an index is important. – Hash-based indexes only good for equality search. – Sorted files and tree-based indexes best for range search; also good for equality search. (Files rarely kept sorted in practice; B+ tree index is better.) v Index is a collection of data entries plus a way to quickly find entries with given key values.

27. Database Management Systems, R. Ramakrishnan and J. Gehrke27 Summary (Contd.) v Data entries can be actual data records, pairs, or pairs. – Choice orthogonal to indexing technique used to locate data entries with a given key value. v Can have several indexes on a given file of data records, each with a different search key. v Indexes can be classified as clustered vs. unclustered, primary vs. secondary, and dense vs. sparse. Differences have important consequences for utility/performance.

28. Database Management Systems, R. Ramakrishnan and J. Gehrke28 Homework v Condition for comparison: Database has B data pages, each data page has R objects, I/O cost for read/write a data page is D, the time for processing an object is C. If hash function is used, the hash time is H. Without considering re-organization! v (a) If only I/O cost is included, compare the performances for heap file, sorted file, hashed file for file organization. v (b) If CPU cost also includes, compare the performances for heap file, sorted file, hashed file for file organization.