Skip site navigation (1) Skip section navigation (2)

Re: Insert performance vs Table size

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: "Praveen Raja" <praveen(dot)raja(at)netlight(dot)se>
Cc: "'Jacques Caron'" <jc(at)directinfos(dot)com>,pgsql-performance(at)postgresql(dot)org
Subject: Re: Insert performance vs Table size
Date: 2005-06-28 14:25:59
Message-ID: 14991.1119968759@sss.pgh.pa.us (view raw or flat)
Thread:
Lists: pgsql-performance
"Praveen Raja" <praveen(dot)raja(at)netlight(dot)se> writes:
> I know that having indexes on the table adds an overhead but again does
> this overhead increase (for an INSERT operation) with the number of rows
> the table contains?

Typical index implementations (such as b-tree) have roughly O(log N)
cost to insert or lookup a key in an N-entry index.  So yes, it grows,
though slowly.

			regards, tom lane

In response to

pgsql-performance by date

Next:From: bsimonDate: 2005-06-28 14:50:17
Subject: Réf. : tricky query
Previous:From: Merlin MoncureDate: 2005-06-28 14:21:16
Subject: tricky query

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group