'Dynamic hashing' diaporamas de présentation

Hashing on the Disk

466 views • 46 slides

CH8. HASHING

CH8. HASHING. 8.1 Symbol table abstract data type. Symbol table pairs (name + attribute) ex) dictionary, library list Operations on a symbol table (1) determine if a particular name is in the table (2) retrieve the attributes of that name (3) modify the attribute of that name

407 views • 40 slides

Hashing

Hashing. Chapter 8. Symbol Table. Symbol table is used widely in many applications. dictionary is a kind of symbol table data dictionary is database management In general, the following operations are performed on a symbol table determine if a particular name is in the table

628 views • 33 slides

Indexing and Hashing

335 views • 24 slides

Chapter 8 Hashing

Chapter 8 Hashing. Part II. Dynamic Hashing. Also called extendible hashing Motivation Limitations of static hashing When the table is to be full, overflows increase. As overflows increase, the overall performance decreases.

460 views • 16 slides

Dynamic Hashing

As the database grows over time, we have three options: Choose hash function based on current file size. Get performance degradation as file grows. Choose hash function based on anticipated file size. Space is wasted initially. Periodically re-organize hash structure as file grows.

126 views • 9 slides