Skip site navigation (1)
Skip section navigation (2)
Peripheral Links
Header And Logo
|
Site Navigation
Re: [PERFORM] BUG #2737: hash indexing large tablefails,while
- From: "Julius.Stroffek" <Julius(dot)Stroffek(at)Sun(dot)COM>
- To: pgsql-bugs(at)postgresql(dot)org
- Cc: pgsql-performance(at)postgresql(dot)org
- Subject: Re: [PERFORM] BUG #2737: hash indexing large tablefails,while
- Date: Fri, 17 Nov 2006 16:36:18 +0100
- Message-id: <455DD6F2(dot)9070009(at)Sun(dot)COM>
Simon Riggs wrote:
I thought about this a bit. I have an idea that the hash index might have the fixed number of buckets specified in create index statement and the tuples in each of these buckets should be stored in a b-tree. This should give a constant performance improvement (but based on the number of buckets) for each fetch of a tuple from index compared to a fetch from b-tree index.Do we think there is hope of improving hash indexes?
cheers Julo
- References:
- BUG #2737: hash indexing large table fails, while btree of same index works
- From: Balazs Nagy
- Re: BUG #2737: hash indexing large table fails, while btree of same index works
- From: Tom Lane
- Re: [PERFORM] BUG #2737: hash indexing large table fails,while btree of same index works
- From: Simon Riggs
- Re: [PERFORM] BUG #2737: hash indexing large table fails,while btree of same index works
- From: Tom Lane
- Re: [PERFORM] BUG #2737: hash indexing large tablefails,while btree of same index works
- From: Simon Riggs
- BUG #2737: hash indexing large table fails, while btree of same index works
- Prev by Date: Re: [PERFORM] BUG #2737: hash indexing large tablefails,while btree of same index works
- Next by Date: BUG #2763: fat
- Previous by thread: Re: [PERFORM] BUG #2737: hash indexing large tablefails,while btree of same index works
- Next by thread: BUG #2738: CREATE FUNCTION INSTR() in docs
- Indexes: