From: | Filip Rembiałkowski <plk(dot)zuber(at)gmail(dot)com> |
---|---|
To: | Richard Klingler <richard(at)klingler(dot)net> |
Cc: | pgsql-sql(at)postgresql(dot)org |
Subject: | Re: Natural sort order |
Date: | 2011-12-17 15:16:07 |
Message-ID: | CAP_rwwkrnuANFjirZvkS=Ca2gejQvQa-xnM-vXsOFSQ1Jy92cQ@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
If you use btrsort(column) from the example, you can just create a
functional index on this expression.
CREATE INDEX mytable_column_btrsort_idx ON mytable( btrsort(column) );
this can help.
2011/12/17 Richard Klingler <richard(at)klingler(dot)net>:
> Morning...
>
> What is the fastest way to achieve natural ordering from queries?
>
> I found a function at:
> http://2kan.tumblr.com/post/361326656/postgres-natural-ordering
>
> But it increases the query time from around 0.4msecs to 74msecs...
> Might be not much if occasional queries are made..but I use it for
> building
> up a hierarchical tree menu in a web application where every msecs
> counts (o;
>
>
> cheers
> richard
>
>
> --
> Sent via pgsql-sql mailing list (pgsql-sql(at)postgresql(dot)org)
> To make changes to your subscription:
> http://www.postgresql.org/mailpref/pgsql-sql
From | Date | Subject | |
---|---|---|---|
Next Message | John Fabiani | 2011-12-17 16:50:52 | Re: using a generated series in function |
Previous Message | Stefan Weiss | 2011-12-17 14:26:33 | Re: Column "..." does not exist (view + union) |