Peter Verswyvelen ha scritto:
Does esist a data structure that is able to store something like 480189 keys
with efficient memory usage?
What is the range of your keys - do they use the full 32-bit of Int -
and what type are the values?
From Netflix Prize documentation:
CustomerIDs range from 1 to 2649429, with gaps. There are 480189 users.
The values are UArr (Word32 :*: Word 8), from uvector package.
Thanks Manlio
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
