Re: Database performance and size

From: Nick Keeman <nick_at_bart.nl>
Date: 1996/01/01
Message-ID: <4c952s$90p_at_nosy.bart.nl>#1/1


In article <4bapid$595_at_newsbf02.news.aol.com>,

   markp10013_at_aol.com (MarkP10013) wrote:
>I was wondering if someone could shed some light on this debate;
>Some people I've talked with think that the performance of a database will
>be
>affected as the number of rows in the tables grow. Others say that
>performance
>won't be affected at all no matter how large the database gets. Which
>opinion is true? I know this sounds trivial, but it's seem to be one of
>those questions that tests theory and real world experiences.
>
> regards,
>
> Mark
The performance will get slower if the number of rows gets bigger!!

For select-statements:

  • Full table scan's have to read more rows from disk or SGA. (Linear slow down)
  • Indexed queries work with search algorithems. a select on a table with 100 rows will be about twice as slow as a select on a table with 10000 rows. (logaritmic slow down)

Just experience for your self using 'explain plan' this will give you some statistics which proves the above.

Nick Keeman.


       ////
      (o o)
___oOo_(_)_oOo________________________________________________________________
                  |                                     |
Nick Keeman       | The Golden rule:                    | email   nick_at_bart.nl
The Hague         | He who has the gold makes the rules | Voice +31-70-3466029
The Netherlands   |                                     |   Fax +31-70-3463418
______________________________________________________________________________
 (   )    (   )
  \ (      ) /

   \_) (_/ Received on Mon Jan 01 1996 - 00:00:00 CET

Original text of this message