On Fri, Jan 25, 2002 at 04:02:23PM -0800, Bruce Sandell wrote:
>
> So does this mean that you should or should not bother using indexes
> on a heap table?
You should use an index on a heap table column just like you would for
any other table. It's just that the index isn't a B-Tree like with
MyI
]
Subject: Re: Indexing hash tables
On Fri, Jan 25, 2002 at 03:44:07PM -0800, Bruce Sandell wrote:
>
> Is the index for a hash table stored on disk or in memory?
You mean for HEAP tables, which used hashed indexes?
> I have a hash table that I am constantly adding data to, which means
&g
On Fri, Jan 25, 2002 at 03:44:07PM -0800, Bruce Sandell wrote:
>
> Is the index for a hash table stored on disk or in memory?
You mean for HEAP tables, which used hashed indexes?
> I have a hash table that I am constantly adding data to, which means
> the index is constantly being updated. If I
Sorry, thats a heap table, not a hash table.
-Original Message-
From: Bruce Sandell [mailto:[EMAIL PROTECTED]]
Sent: Friday, January 25, 2002 3:44 PM
To: [EMAIL PROTECTED]
Subject: Indexing hash tables
Is the index for a hash table stored on disk or in memory? I have a hash
table that
Is the index for a hash table stored on disk or in memory? I have a hash
table that I am constantly adding data to, which means the index is
constantly being updated. If I keep the size of the key buffer sufficiently
large, will the new index values be there upon creation, or not until they
are
