P
Pallav singh
Hi All ,
i have data coming at variable rate and basic requirement was look up
and insertion should be very Fast
i used STL MAP for that , but when data was very HUGE(10 GB data was
to be stored in MAP ), its performance degraded.
Time to fetch data based on KEY increases exponentially.
when I use unordered_map of C++0x to store data, it got reduced
significantly.
Is there any Other container provided by Boost or Ace Framework, which
i can use to reduce my Look up time more.
Thanks
Pallav Singh
i have data coming at variable rate and basic requirement was look up
and insertion should be very Fast
i used STL MAP for that , but when data was very HUGE(10 GB data was
to be stored in MAP ), its performance degraded.
Time to fetch data based on KEY increases exponentially.
when I use unordered_map of C++0x to store data, it got reduced
significantly.
Is there any Other container provided by Boost or Ace Framework, which
i can use to reduce my Look up time more.
Thanks
Pallav Singh