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

First Page		Document Content
Date: 2011-09-20 03:36:42 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 Add to Reading List Source URL: www.sigops.org Download Document from Source Website File Size: 2,01 MB Share Document on Facebook

	MinCounter: An Efficient Cuckoo Hashing Scheme for Cloud Storage Systems Yuanyuan Sun Yu Hua Dan Feng DocID: 1tLMg - View Document
	History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡ Udi Wieder§ DocID: 1t8LN - View Document
	History-Independent Cuckoo Hashing Moni Naor∗‡ Gil Segev†‡ Udi Wieder§ DocID: 1rysW - View Document
	Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University DocID: 1r5sy - View Document
	Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream DocID: 1qUBE - View Document