<--- Back to Details
First PageDocument Content
Computing / Information science / Hash join / Hash table / Hash function / Bloom filter / Trie / Cryptographic hash function / Database index / Hashing / Search algorithms / Data management
Date: 2014-11-12 16:58:02
Computing
Information science
Hash join
Hash table
Hash function
Bloom filter
Trie
Cryptographic hash function
Database index
Hashing
Search algorithms
Data management

Memory-Efficient Hash Joins

Add to Reading List

Source URL: www.vldb.org

Download Document from Source Website

File Size: 571,05 KB

Share Document on Facebook

Similar Documents

Cryptography / Block ciphers / Data Encryption Standard / Finite fields / Feistel cipher / ARIA / Advanced Encryption Standard / Differential cryptanalysis / ICE / Interpolation attack / Stream cipher / XTR

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Information retrieval / Hashing / Information science / Search algorithms / Locality-sensitive hashing / Hash function / Hash table / Cryptographic hash function / Hash list / MinHash / RabinKarp algorithm

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Computing / Software engineering / Computer programming / Object-oriented programming languages / Abstract data types / Object / Java / Iterator / Scala / Abstraction / Java collections framework / Object-oriented programming

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document