1. CS 4432lecture #61 CS4432: Database Systems II Lecture #6 Professor Elke A. Rundensteiner

2. CS 4432lecture #62 PROJECT 1 Project-1 teams assigned (my.wpi) If any issues, let us know sooner rather than later … Must state each member’s contributions …

3. CS 4432lecture #63 Storage Layout : How to lay out data on disk. ( chapter 3)

4. CS 4432lecture #64 Placing records into blocks blocks... a file assume fixed length blocks assume a single file (for now)

5. CS 4432lecture #65 (1) separating records (2) spanned vs. unspanned (3) mixed record types – clustering (4) split records (5) sequencing (6) indirection Options for storing records in blocks:

6. CS 4432lecture #66 Fixed part in one block Typically for hybrid format Variable part in another block (4) Split records

7. CS 4432lecture #67 Block with fixed recs. R1 (a) R1 (b) Block with variable recs. R2 (a) R2 (b) R2 (c)

8. CS 4432lecture #68 Ordering records in file (and block) by some key value –Sequential file ( -  sequenced file) Why sequencing ? –Typically to make it possible to efficiently read records in order (5) Sequencing

9. CS 4432lecture #69 Sequencing Options (a) Next record physically contiguous... (b) Linked What about INSERT/ DELETE ? Next (R1)R1 Next (R1)

10. CS 4432lecture #610 (c)Overflow area Records in sequence R1 R2 R3 R4 R5 Sequencing Options header R2.1 R1.3 R4.7

11. CS 4432lecture #611 How does one refer to records? Problem: Records can be on disk or in (virtual) memory. Need common address, but have different physical locations. (6) Indirection Addressing Rx Many options: PhysicalIndirect

12. CS 4432lecture #612 Purely Physical Addressing Device ID E.g., RecordCylinder # Address=Track # ( ID ) Block # Offset in block Block ID

13. CS 4432lecture #613 Fully Indirect Addressing Solution: Record ID (Oracle: ROWID) as global address, maintain a map table. Map Table rec ID raddress a Physical addr. Rec ID

14. CS 4432lecture #614 Tradeoff Flexibility Cost to move recordsof indirection (for deletions, insertions) (lookup) What to do : Options inbetween ? Physical Indirect

15. CS 4432lecture #615 Ex #1 : Indirection in block Block Header A block:Free space R3 R4 R1R2

16. CS 4432lecture #616 Block header - data at beginning that describes block May contain: - File ID (or RELATION or DB ID) - This block ID - Record directory - Pointer to free space - Type of block (e.g. contains recs type 4; is overflow, …) - Pointer to other blocks “like it” - Timestamp...

17. CS 4432lecture #617 Ex. #2 Use logical block #’s understood by file system instead of direct disk access REC ID File ID Block # Record # or Offset File ID,Physical Block #Block ID File System Map

18. CS 4432lecture #618 (1) Separating records (2) Spanned vs. Unspanned (3) Mixed record types - Clustering (4) Split records (5) Sequencing (6) Indirection Recap: Storing records in blocks

19. CS 4432lecture #619 (1) Insertion/Deletion (2) Buffer Management (3) Comparison of Schemes Other Topics in Chapter 3

20. CS 4432lecture #620 Block Deletion Rx

21. CS 4432lecture #621 Options: (a)Deleted and immediately reclaim space (b)Mark deleted –May need chain of deleted records (for re-use) –Need a way to mark: special characters delete field in map

22. CS 4432lecture #622 As usual, many tradeoffs... How expensive is to move valid record to free space for immediate reclaim? How much space is wasted? –e.g., deleted records, delete fields, free space chains,...

23. CS 4432lecture #623 Dangling pointers Note: If pointers point to physical locations (rather than ROWIDs), storing new data in deleted block corrupts data. Concern with deletions R1?

24. CS 4432lecture #624 Solution #1: Do not worry

25. CS 4432lecture #625 E.g., Leave “MARK” in map or old location Solution #2: Tombstones Physical IDs A block This spaceThis space can never re-usedbe re-used

26. CS 4432lecture #626 Logical IDs IDLOC 7788 map Never reuse ID 7788 nor space in map... E.g., Leave “MARK” in map or old location Solution #2: Tombstones

27. CS 4432lecture #627 Place record ID within every record When you follow a pointer, check if it leads to correct record Solution #3 (?): Does this work??? If space reused, won’t new record have same ID? to 3-77 rec-id: 3-77

28. CS 4432lecture #628 Easy case: Records fixed length/not in sequence  Insert new record at end of file  or, in deleted slot A little harder:  If records are variable size, not as easy  may not be able to reuse space – fragmentation Hard case: records in sequence  If free space “close by”, not too bad...  Or, use overflow idea...  Or worst case, reorganize file... Insert

29. CS 4432lecture #629 Interesting problems: How much free space to leave in each block, track, cylinder? How often do I reorganize file + overflow? Free space

30. CS 4432lecture #630 DB features needed Why LRU may be bad Read Pinned blocks Textbook! Forced output Double buffering Swizzling Buffer Management in Notes03

31. CS 4432lecture #631 Pointer Swizzling Memory Disk Rec A block 1 Rec A block 2 block 1 Issue : If records (objects) contain pointers to other objects, translate locations when load objects into memory.

32. CS 4432lecture #632 TranslationDB Addr Mem Addr Table Rec-A Rec-A-inMem One Option: Solution: Insert fields that represent pointers into map table. Translate pointers as needed.

33. CS 4432lecture #633 In memory pointers - need “type” bit to disk to memory M Another Option:

34. CS 4432lecture #634 Swizzling Issues Automatic On-demand No swizzling / program control Swizzling Options Must ‘unswizzle’ Updating/writing of records

35. CS 4432lecture #635 There are 1,000,001 ways to organize my data on disk… Which is right for me? Comparison

36. CS 4432lecture #636 Issues: FlexibilitySpace Utilization ComplexityPerformance

37. CS 4432lecture #637 To evaluate a given strategy, compute following parameters: -> space used for expected data - on average -> expected time to : - fetch record given key - fetch record with next key - insert/delete/update record - read complete file - reorganize file (maybe sort) -> usage patterns / workload: - how many/which user queries/updates

38. CS 4432lecture #638 Example : What about Project 1? Design decisions for CAPE queue storage system? –What data types? –Variable/Fixed length records? –Fixed/Variable format? –Record IDs ? –Sequencing? What’s special here ? –Deletions? –Insertions? –Headers/Meta-data for Queues? –Buffering/Disk Pushing? –Reorganize files and Overflow? –Defragmentation? –…

39. CS 4432lecture #639 Chapter 4 (Chapter 13 in ‘compete book’ ) How to find a record quickly, given a key TOMORROW