First Page | Document Content | |
---|---|---|
![]() Date: 2009-07-16 16:17:48Information retrieval Artificial intelligence Bloom filter Hash table Cuckoo hashing Hash function Bit array Perfect hash function Trie Hashing Search algorithms Information science | Source URL: theory.stanford.eduDownload Document from Source WebsiteFile Size: 397,68 KBShare Document on Facebook |
![]() | SILT: A Memory-Efficient, High-Performance Key-Value StoreDocID: 1qLCY - View Document |
![]() | Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†DocID: 1qrlz - View Document |
![]() | Microsoft Word - NLA-monographdocDocID: 1pwXw - View Document |
![]() | Optimal Hashing Schemes for Entity Matching Nilesh Dalvi Vibhor Rastogi Anirban DasguptaDocID: 1lrsK - View Document |
![]() | Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen, DenmarkDocID: 1aNzo - View Document |