國立高雄大學圖資館 |

Language: English

Back

The joys of hashinghash table progra...

Mailund, Thomas.

The joys of hashinghash table programming with C /

Record Type:	Electronic resources : Monograph/item
Title/Author:	The joys of hashingby Thomas Mailund.
Reminder of title:	hash table programming with C /
Author:	Mailund, Thomas.
Published:	Berkeley, CA :Apress :2024.
Description:	xi, 218 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Hashing (Computer science)
Online resource:	https://doi.org/10.1007/979-8-8688-0826-5
ISBN:	9798868808265$q(electronic bk.)

The joys of hashinghash table programming with C /
Mailund, Thomas.

The joys of hashinghash table programming with C /[electronic resource] :by Thomas Mailund. - Second edition. - Berkeley, CA :Apress :2024. - xi, 218 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 Values -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.

Build working implementations of hash tables, written in the C programming language. The new and revised Second Edition has been enhanced with simplified code and more comprehensive explanations, aimed at improving clarity and comprehension while exploiting the latest features in C programming. This book starts with simple first attempts devoid of collision resolution strategies. It then progresses through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. You will learn how 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. What You Will Learn 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: 9798868808265$q(electronic bk.)

Standard No.: 10.1007/979-8-8688-0826-5doiSubjects--Topical Terms:

611851
Hashing (Computer science)

LC Class. No.: QA76.9.H36

Dewey Class. No.: 005.741

The joys of hashinghash table programming with C /
LDR:02608nmm a2200337 a 4500 001 671648
003 DE-He213
005 20241026125721.0
006 m d
007 cr nn 008maaau
008 250325s2024 cau s 0 eng d
020 $a 9798868808265$q(electronic bk.)
020 $a 9798868808258$q(paper)
024 7 $a 10.1007/979-8-8688-0826-5 $2 doi
035 $a 979-8-8688-0826-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.H36
072 7 $a UMC $2 bicssc
072 7 $a COM010000 $2 bisacsh
072 7 $a UMC $2 thema
082 0 4 $a 005.741 $2 23
090 $a QA76.9.H36 $b M222 2024
100 1 $a Mailund, Thomas. $3 776342
245 1 4 $a The joys of hashing $h [electronic resource] : $b hash table programming with C / $c by Thomas Mailund.
250 $a Second edition.
260 $a Berkeley, CA : $b Apress : $b Imprint: Apress, $c 2024.
300 $a xi, 218 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 Values -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions.
520 $a Build working implementations of hash tables, written in the C programming language. The new and revised Second Edition has been enhanced with simplified code and more comprehensive explanations, aimed at improving clarity and comprehension while exploiting the latest features in C programming. This book starts with simple first attempts devoid of collision resolution strategies. It then progresses through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. You will learn how 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. What You Will Learn 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 611851
650 0 $a C (Computer program language) $3 181957
650 1 4 $a Compilers and Interpreters. $3 914937
650 2 4 $a Programming Techniques. $3 274470
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/979-8-8688-0826-5
950 $a Professional and Applied Computing (SpringerNature-12059)