Querying expense and weak hashtables

Before I forget about this...

I've noted in the past that querying a lot is one way to bump up beagled's memory usage fairly easily.

There's a discussion going on at the dotLucene forums about a fairly serious memory problem in Lucene's field caching:


The java Lucene uses a WeakHashMap:

There isn't a direct equivalent in C# so a Hashtable is used, which doesn't have the same characteristics.

This is worth keeping an eye on...


[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]