1 / 2

Dynamische Hashverfahren (2)

Berechnungsbeispiele:. ATL. A. 00001. (1). HEL. H. 01000. (8). T. 10100. (20). E. 00101. (5). L. 01100. (12). L. 01100. (12). XOR. 11001. XOR. 00001. Dynamische Hashverfahren (2). Beispiel: Erweiterbares Hashing. d=4. 0000. 0001. 0010. 0011. 0100. 0101. 0110.

phong
Download Presentation

Dynamische Hashverfahren (2)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Berechnungsbeispiele: ATL A 00001 (1) HEL H 01000 (8) T 10100 (20) E 00101 (5) L 01100 (12) L 01100 (12) XOR 11001 XOR 00001 Dynamische Hashverfahren (2) Beispiel: Erweiterbares Hashing. d=4 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 d=4 d=4 d=4 d=3 d=3 d=2 d=4 d=4 d=3 d=4 JFK GIG ANC EWR DUS FRA ATL MUC HAM ATH SYD ZAG HEL MIA LEJ NRT LAX ORD SFO SOF TRN OSA TXL YMQ LHR ZRH DRS BOS

  2. Dynamische Hashverfahren (2) Beispiel: Nach Einfügen von VIE, CPH, SCL d=5 00000 00010 00100 00110 01000 01010 01100 01110 10000 10010 10100 10110 11000 11010 11100 11110 00001 00011 00101 00111 01001 01011 01101 01111 10001 10011 10101 10111 11001 11011 11101 11111 d=4 d=4 d=4 d=3 d=3 d=2 d=4 d=4 JFK GIG ANC EWR DUS FRA ATL HAM SYD HEL MIA LEJ NRT LAX ORD TRN TXL YMQ LHR ZRH DRS d=5 d=5 d=4 d=4 VIE MUC ATH BOS SFO CPH ZAG SOF OSA SCL

More Related