Max Zone
Posts: 9170
Nickname: dzone
Registered: Jun, 2006
|
dzone.com is a link-sharing community where member participation determines what gets published
|
|
|
|
Bloom Filters in C#
|
Posted: Apr 13, 2007 3:25 PM
|
|
|
This post originated from an RSS feed registered with .NET Buzz
by Max Zone.
|
Original Post: Bloom Filters in C#
Feed Title: dzone.com: .net
Feed URL: http://www.dzone.com/feed/frontpage/.net/rss.xml
Feed Description: dzone.com: fresh .net links for developers
|
Latest .NET Buzz Posts
Latest .NET Buzz Posts by Max Zone
Latest Posts From dzone.com: .net
|
|
But what happens when the number or size of items begins to exceed available memory? Tens of millions of names start to occupy hundreds of megabytes. Inserting an item into a sorted list of ten million items takes significant time. A hash table helps with the speed issue, but at the cost of having to store the hash codes along with the strings, and the additional runtime overhead of having to handle hash collisions. When you get to hundreds of millions of items, it's unlikely that you'll have enough memory to hold the entire table in RAM. At that point you need to make a choice: find an efficient way to store and lookup items on disk, or find a faster and more memory-efficient way to do it within the available memory.
Read: Bloom Filters in C#
|
|
Previous Topic
