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 <rich...@klingler.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@postgresql.org) > To make changes to your subscription: > http://www.postgresql.org/mailpref/pgsql-sql -- Sent via pgsql-sql mailing list (pgsql-sql@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-sql
