数据结构8.hashing.pdfVIP

Hashing • The Dictionary • a dictionary (table) is an abstract model of a database • a dictionary stores key-element pairs • the main operation supported by a dictionary is searching by key Hashing • Applications • Telephone directory • Library catalogue • Books in print: key ISBN • FAT (File Allocation Table) ADT template class K, class E class Dictionary { public: virtual bool IsEmpty () const = 0; virtual pairK,E* Get(const K) const = 0; virtual void Insert(const pairK,E) = 0; virtual void Delete(const K) = 0; }; Implementing a Dictionary with a Sequence • unordered sequence – searching and removing takes O(n) time – inserting takes O(1) time – applications to log files (frequent insertions, rare searches and removals) 34 14 12 22 18 34 14 12 22 18 Implementing a Dictionary with a Sequence • array-based ordered sequence (assumes keys can be ordered) • - searching takes O(log n) time (binary search) - inserting and removing takes O(n) time - application to look-up tables (frequent searches, rare insertions and removals) 12 14 18 22 34 Other Implementations? • Binary search tree – O(h) O(n) • Balanced search trees – O(logN) • Key comparison based • Can we do better? Application • China Telecom is a large phone company, and they want to provide enhanced caller ID capability: – given a phone number, return the caller’s name 10 – phone numbers are in the range 0 to R = 10