6. Database Indexes_[Hash]

• Motivation
  • Find the relevant data by using a function to map between a key to an index of a data structure
• Hash Table
  • Data is stored in a data structure called Hash Table
  • Hash is a function to map a key to an index to its information
  • Consideration
    • what if the result of the fuction yields index out-of-bound 
      • out-of-bound 잘 고려해서 만들어야 함 ex. 나머지 연산자 활용
    • what if the result of the function conflicts for different keys
      • 같은 곳에 모이게 될 때 어떻게 처리할 것인지 ex. linked-list 생성

Hash 에서 out-of-bound(->나머지 연산자 활용), conflicts(->linked-list 활용) 등 고려하기 중요