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

	Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange David Derler1 , Kai Gellert2 , Tibor Jager2 , Daniel Slamanig3 , and Christoph Striecks3 1 Graz University of Technology DocID: 1xVie - View Document
	Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange David Derler‡ , Tibor Jagerk , Daniel Slamanig§ , Christoph Striecks§ May 3, 2018—Eurocrypt 2018, Tel Aviv, Israel DocID: 1xV7Y - View Document
	Improving Bloom filter performance on sequence data using k-mer Bloom filters David Pellow1? , Darya Filippova2 , and Carl Kingsford2?? 1 The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Is DocID: 1vcxL - View Document
	Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange David Derler‡ , Tibor Jagerk , Daniel Slamanig§ , Christoph Striecks§ January 12, 2018—RWC 2018, Zurich, Switzerland DocID: 1uxHv - View Document
	Hierarchical Bloom Filter Trees for Approximate Matching DocID: 1uvQT - View Document