東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The joys of hashing = hash table pro...

Mailund, Thomas.

Linked to FindBook

Google Book

Amazon

博客來

The joys of hashing = hash table programming with C /

Record Type:	Electronic resources : Monograph/item
Title/Author:	The joys of hashing/ by Thomas Mailund.
Reminder of title:	hash table programming with C /
Author:	Mailund, Thomas.
Published:	Berkeley, CA :Apress : : 2019.,
Description:	xi, 206 p. :ill., digital ;24 cm.
[NT 15003449]:	1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Valuse -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.
Contained By:	Springer eBooks
Subject:	Hashing (Computer science) -
Online resource:	https://doi.org/10.1007/978-1-4842-4066-3
ISBN:	9781484240663

The joys of hashing = hash table programming with C /
Mailund, Thomas.

The joys of hashinghash table programming with C /[electronic resource] :by Thomas Mailund. - Berkeley, CA :Apress :2019. - xi, 206 p. :ill., digital ;24 cm.

1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Valuse -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.

Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. You will: Master the basic ideas behind hash tables Carry out collision resolution, including strategies for handling collisions and their consequences for performance Resize or grow and shrink tables as needed Store values by handling when values must be stored with keys to make general sets and maps.

ISBN: 9781484240663

Standard No.: 10.1007/978-1-4842-4066-3doiSubjects--Topical Terms:

1966473
Hashing (Computer science)

LC Class. No.: QA76.9.H36 / M355 2019

Dewey Class. No.: 005.741

The joys of hashing = hash table programming with C /
LDR:02352nmm a2200337 a 4500 001 2179625
003 DE-He213
005 20190813153605.0
006 m d
007 cr nn 008maaau
008 191122s2019 cau s 0 eng d
020 $a 9781484240663 $q (electronic bk.)
020 $a 9781484240656 $q (paper)
024 7 $a 10.1007/978-1-4842-4066-3 $2 doi
035 $a 978-1-4842-4066-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.H36 $b M355 2019
072 7 $a UMX $2 bicssc
072 7 $a COM051010 $2 bisacsh
072 7 $a UMX $2 thema
072 7 $a UMC $2 thema
082 0 4 $a 005.741 $2 23
090 $a QA76.9.H36 $b M222 2019
100 1 $a Mailund, Thomas. $3 3227792
245 1 4 $a The joys of hashing $h [electronic resource] : $b hash table programming with C / $c by Thomas Mailund.
260 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2019.
300 $a xi, 206 p. : $b ill., digital ; $c 24 cm.
505 0 $a 1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Valuse -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.
520 $a Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. You will: Master the basic ideas behind hash tables Carry out collision resolution, including strategies for handling collisions and their consequences for performance Resize or grow and shrink tables as needed Store values by handling when values must be stored with keys to make general sets and maps.
650 0 $a Hashing (Computer science) $3 1966473
650 1 4 $a Programming Languages, Compilers, Interpreters. $3 891123
650 2 4 $a Programming Techniques. $3 892496
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u https://doi.org/10.1007/978-1-4842-4066-3
950 $a Professional and Applied Computing (Springer-12059)