CSE 214 Lecture 34: Tables
5 Dec 2016
School
Department
Course
Professor
Document Summary
A table, or dictionary is an abstract data type whose data items are stored and retrieved according to a key value. Each record can have a number of data fields. The data is ordered based on one of the fields, named the key field. The record we are searching for has a key value that is called the target. The table may be implemented using a variety of data structures: array, tree, heap, etc. When you shrink the number of keys with the same amount of items, collision starts to occur as more items will be mapped to the same key. The inefficient and brute force way to find an item is sequential search. Can be applied to any random access structure where the data elements are sorted. Translating one thing to another using a hash function, like translating each value into a key. The hash function translates a value into a usable key.
