<--- Back to Details
First PageDocument Content
Information retrieval / Artificial intelligence / Bloom filter / Hash table / Cuckoo hashing / Hash function / Bit array / Perfect hash function / Trie / Hashing / Search algorithms / Information science
Date: 2009-07-16 16:17:48
Information retrieval
Artificial intelligence
Bloom filter
Hash table
Cuckoo hashing
Hash function
Bit array
Perfect hash function
Trie
Hashing
Search algorithms
Information science

Add to Reading List

Source URL: theory.stanford.edu

Download Document from Source Website

File Size: 397,68 KB

Share Document on Facebook

Similar Documents

Information science / Information retrieval / Search algorithms / Hashing / Computing / Trie / Hash table / Cuckoo hashing / Bloom filter / Hash function / Perfect hash function / Database index

SILT: A Memory-Efficient, High-Performance Key-Value Store

DocID: 1qLCY - View Document

Information science / Information retrieval / Search algorithms / Hashing / Cuckoo hashing / Hash table / Perfect hash function / Hash function / Linear probing / Randomized algorithm / Big O notation / Double hashing

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

DocID: 1qrlz - View Document

Search algorithms / Hashing / Functions and mappings / Topology / Dynamic perfect hashing / Function / Universal hashing / Hash table / Set / Hash function / Binary relation / Surjective function

Microsoft Word - NLA-monographdoc

DocID: 1pwXw - View Document

Hashing / Search algorithms / Hash function / Cryptographic hash function / Join / Dynamic programming / Record linkage / Hash table / Dynamic perfect hashing

Optimal Hashing Schemes for Entity Matching Nilesh Dalvi Vibhor Rastogi Anirban Dasgupta

DocID: 1lrsK - View Document

Information science / Artificial intelligence / Hash table / Hash function / Linear probing / Cuckoo hashing / Double hashing / Perfect hash function / Quadratic probing / Search algorithms / Hashing / Information retrieval

Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen, Denmark

DocID: 1aNzo - View Document