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

Re: efficient storing of urls

From: Chris Browne <cbbrowne(at)acm(dot)org>
To: pgsql-general(at)postgresql(dot)org
Subject: Re: efficient storing of urls
Date: 2004-02-28 00:18:00
Message-ID: (view raw, whole thread or download thread mbox)
Lists: pgsql-general
shannyconsulting(at)earthlink(dot)net (Sean Shanny) writes:
> Can you give an example of a query that has gotten slower due to the
> increasing size of the urls table with an explain analyze?

There's a "known issue" in that URL strings commonly contain the prefix:


What you get, as a result, is that there's very little uniqueness
there, and indices are known to suffer.

There was a report last week that essentially putting the URLs in
backwards, and having a functional index on the backwards form, led to
greatly improved selectivity of the index.

The approach being suggested here looks more like that of the "prefix
splitting" typical to Patricia Tries; that's what the New Oxford
English Dictionary project used for building efficient text search
indices.  It ought to be pretty quick, but pretty expensive in terms
of the complexity that gets added in.

I suspect that doing the "reverse the URL" trick would be a cheaper
"This .signature is  shareware.  Send in $20 for  the fully registered

In response to

pgsql-general by date

Next:From: Bill MoranDate: 2004-02-28 00:47:53
Subject: Regarding BITs vs. INTs
Previous:From: Shane WegnerDate: 2004-02-28 00:00:09
Subject: Re: efficient storing of urls

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