Linear Hashing vs Extendible Hashing Less Code LH

Linear Hashing vs. Extendible Hashing ▪ ▪ ▪ ▪ Less Code: LH Less Space: LH Higher Performance: EH potentially No Overflow Buckets: EH No Directory: LH Complexity of EH: B O(1), E O(1), W O(1) Complexity of LH: B O(1), E O(1), W O(n) CSCIX 370: Database Management

EH - Insert 3, 4, 7, 2, 5, 1, 6 0: [. , . ] bp = *0 1: [. , . ] bp = *1 0: [4, 2] bp = *0 1: [3, 7] bp = *1 0: [4, 2] bp = *0 1: [5, 1] bp = *01 3: [3, 7] bp = *11 0: [4, . ] bp = *00 1: [5, 1] bp = *01 3: [3, 7] bp = *11 2: [2, 6] bp = *10 insert 5 => OVF insert 1, 6 => OVF buckets are out of order => a directory (not shown) is required CSCIX 370: Database Management

LH - Insert 3, 4, 7, 2, 5, 1, 6 0: [. , . ] bp = *0 <— spilt 1: [. , . ] bp = *1 0: [4, 2] bp = *0 <— spilt 1: [3, 7] bp = *1 insert 5 => OVF 0: [4, . ] bp = *00 1: [3, 7] bp = *1 —> [5, . ] <— spilt insert 1 => OVF 2: [2, , ] bp = *10 0: [4, . ] bp = *00 <— spilt (is reset) 1: [5, 1] bp = *01 2: [2, 6] bp = *10 bucket 2 and 3 are in order 3: [3, 7] bp = *11 they are reversed for EH CSCIX 370: Database Management

Project 3 • Implement Lin. Hash. Map. java • Integrate with Table. java • See e. LC and Webpage (item 9) for details: • http: //cobweb. cs. uga. edu/~jam/home/ courses/csci 4370/slides_summer 20/ • Questions answered in 7/14/2020 zoom meeting CSCIX 370: Database Management

Final Term Project • Implement a Database/Web Application • My. SQL + Database Access Technology + JVM-based Web Framework • See e. LC and Webpage (item 10) for details: • http: //cobweb. cs. uga. edu/~jam/home/c ourses/csci 4370/slides_summer 20/ • Questions answered in 7/14/2020 zoom meeting CSCIX 370: Database Management