On 2019-05-18 19:16:19 -0500, Ron wrote:
> On 5/18/19 5:39 PM, Peter J. Holzer wrote:
> > On 2019-05-18 17:14:59 -0500, Ron wrote:
> > > On 5/18/19 3:49 PM, Peter J. Holzer wrote:
> > > On 2019-05-18 15:19:22 -0500, Ron wrote:
> > > On 5/18/19 2:27 PM, Peter J. Holzer wrote:
> > >
On 5/19/19 5:43 AM, Peter J. Holzer wrote:
[snip]
But please be aware that I answered your question 'How is it "using
math" to use a hash key?', not 'How are hash indexes in PostgreSQL
implemented?'. So my answer covered the most simple and generic
implementation.
I understand.
--
Angular mome
Greetings,
* David G. Johnston (david.g.johns...@gmail.com) wrote:
> On Thu, May 16, 2019 at 8:31 AM Daulat Ram
> wrote:
>
> > url_hash| bigint | | not null |
>
> Change the type of url_hash; make it text instead of bigint.
Making it text wastes a bunch of sp
Greetings,
* Peter J. Holzer (hjp-pg...@hjp.at) wrote:
> On 2019-05-18 19:16:19 -0500, Ron wrote:
> > > If the the table fills up, you increase nr_buckets, reallocate and
> > > rehash all entries.
> >
> > Ouch. Response time on a big table would take a serious hit if that rehash
> > happened in
