|
Boost Users : |
Subject: Re: [Boost-users] complexity problem using multi_index insert()
From: Andrew Kokkalis (andrewkokkalis_at_[hidden])
Date: 2010-02-28 04:59:22
>
> > I'm using them for the process of clustering a huge amount of data
> > (posts from an aple blog from the last 4-5 years)I'm counting
> > Euclidean distance between two clusters, which I store in a multi_index
> > container like the above
> > [...]
> > My problem is that I have to count 9500! (! = factorial) distances,
> > and store them in the multi_index container.
>
> I think I'm misunderstanding this: do you mean your container
> is holding 9500! elements? As 9500! ~ 9*10^33664 this can't possibly
> be the case.
>
Is it impossible for a container such as the above to hold that much
elements?
during insertion ram is over 2.4 gb (only for this program).
I'm running now the program with different parameters and see the number of
elements that are stored.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net