OK , thanks for all answers ....
"Jonathan Lewis" <jonathan_at_jlcomp.demon.co.uk> a écrit dans le message de
news: baanrk$m8s$1$830fa17d_at_news.demon.co.uk...
>
> If you know roughly the size the index
> will be (average(row length) * number of rows)
> is a guideline, and have enough memory, then
> size of index * 1.2
> will be about the right amount for a complete
> in-memory sort, which will be the fastest.
> Allow plenty of spare as this is a very rough
> approximation.
>
> If you don't have anything like that amount of
> memory free, then the next best is the 'one-pass'
> sort, where the data gets dumped to disc once
> in chunks and re-read. In this case, there is an
> excellent note on Steve Adams' website that
> describes how to calculate the amount of memory
> you need to achieve a one-pass sort. See
> http://www.ixora.com.au
>
>
> --
> Regards
>
> Jonathan Lewis
> http://www.jlcomp.demon.co.uk
>
> The educated person is not the person
> who can answer the questions, but the
> person who can question the answers -- T. Schick Jr
>
>
> One-day tutorials:
> http://www.jlcomp.demon.co.uk/tutorial.html
>
> ____Denmark__May 21-23rd
> ____Sweden___June
> ____Australia__June 28th (Canberra - CBO)
> ____Finland__September
> ____Norway___September
>
>
> Three-day seminar:
> see http://www.jlcomp.demon.co.uk/seminar.html
> ____UK_(Manchester)_May x 2
> ____Estonia___June 4th - 6th
> ____Australia_June 18th - 20th (Perth)
> ____Australia_June 23rd - 25th (Melbourne)
> ____USA_(CA, TX)_August
> ____UK___September
>
> The Co-operative Oracle Users' FAQ
> http://www.jlcomp.demon.co.uk/faq/ind_faq.html
>
>
> "zeb" <thierry.constant1.nospam_at_free.fr> wrote in message
> news:3ec747cb$0$17283$626a54ce_at_news.free.fr...
> > Hi,
> >
> > Is there a way to estimate the sort_area_size for the creation of
> index for
> > a big table ?
> >
> > Thanks in advance
> >
> >
>
>
Received on Mon May 19 2003 - 14:37:30 CDT
