rtree index very large

From: Christopher Zach <zach(at)icg(dot)tu-graz(dot)ac(dot)at>
To: pgsql-general(at)postgresql(dot)org
Subject: rtree index very large
Date: 2001-06-11 22:05:57
Message-ID: 3B2540C5.BAD4FD61@icg.tu-graz.ac.at
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Hi,

I've inserted 100000 random boxes into a table and created a rtree index
on it. Indexing needed a few minutes and finally I got a 200MB page file
for the index. Can someone explain this to me?

BTW: I did the same with Oracle 8i Spatial and the index seems to be a
lot smaller. Selection time for geometric queries (non-empty
intersection with a box) is roughly the same - a few seconds for both
DBMS, but I don't have exact statistics.

I can guess a possible explanation for the smaller index in Oracle:
coordinates are rounded according the given accuracy, which could result
in smaller rtrees, but this is just a guess.

regards,

Christopher

Browse pgsql-general by date

  From Date Subject
Next Message Andrew W. Schmeder 2001-06-11 22:12:58 pg_dump problem...
Previous Message Tim Barnard 2001-06-11 21:46:44 Re: Odd behavior with LIKE?