Design of Hashing Algorithms (Lecture Notes in Computer Science, 756)

This work presents recent developments in hashing algorithm design. Hashing is the process of creating a short digest (i.e., 64 bits) for a message of arbitrary length, for exam- ple 20 Mbytes. Hashing algorithms were first used for sear- ching records in databases; they are central for digital si- gnature applications and are used for authentication without secrecy. Covering all practical and theoretical issues related to the design of secure hashing algorithms the book is self contained; it includes an extensive bibliography on the topic.

ASIN

3540575006

Embedding

CLIP ViT-L/14 · 768d

Distance metric

cosine

Doc fetch

3ms·cache hitGET /v2/namespaces/amazon-products/documents/3540575006

How it works

Similar query

27msnearest_to_id → /query

Doc fetch goes through Layer's Aerospike pull-through cache; cache hit served the row without touching turbopuffer. The similar query asks Layer for nearest neighbors of the stored product vector — queries don't go through the doc cache, so no cache header is set.