First Page | Document Content | |
---|---|---|
Date: 2011-07-09 03:31:58Information science Artificial intelligence Hash table Trie Hash function Hash array mapped trie Cryptographic hash function Perfect hash function Universal hashing Hashing Search algorithms Information retrieval | Add to Reading ListSource URL: infoscience.epfl.chDownload Document from Source WebsiteFile Size: 218,93 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 |