Hi Luke On Mon, Feb 23, 2009 at 8:13 AM, Luke <[email protected]> wrote: > > Thanks for the benchmark, Mateusz! > > Are you sure you're comparing the same thing? the std::map test uses a > map<int, map<int, int> >. And the Judy test's first level index is a > static hash table, which would be faster than anything for first leve
Umm.. Right. Please forgive me :-) > indexing. Just doing a simple map<string, int> vs JudySL would be > more interesting (to me.), as the performance of range scans is > important for cell cache, which Judy array should support. OTOH, the > current Judy array interface is too limiting to implement a non- > trivial key without major hacking on the code, which is quite scary. I can do the comparison of map<string, int> vs JudySL. And yes, the current interface is rather rough but maybe I can come up with some nice C++ wrapper for it if it turns out to be worth it. Mateusz --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Hypertable Development" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/hypertable-dev?hl=en -~----------~----~----~----~------~----~------~--~---
