Haskell Data Analysis Cookbook

Chapter 4. Data Hashing

In this chapter, we will cover the following recipes:

• Hashing a primitive data type
• Hashing a custom data type
• Running popular cryptographic hash functions
• Running a cryptographic checksum on a file
• Performing fast comparisons between data types
• Using a high-performance hash table
• Using Google's CityHash hash functions for strings
• Computing Geohash for location coordinates
• Using a bloom filter to remove unique items
• Running MurmurHash, a simple but speedy hashing algorithm
• Measuring image similarity with perceptual hashes

Introduction

A hash is a lossy way of representing an object into a small and typically fixed-length value. Hashing ...