Date: 2003-07-24 11:26:24Arrays Hashing Data Associative arrays Bloom filter Hash table Trie Lookup table Hash function Search algorithms Computing Computer programming | | Longest Prefix Matching Using Bloom Filters Sarang Dharmapurikar Praveen Krishnamurthy David E. Taylor [removed] [removed] [removed] Washington University in Saint Louis 1 Brookings DriveDocument is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 205,67 KB |