On Wed, Jun 27, 2012 at 10:40 AM, Andy Halsall halsall_a...@hotmail.com wrote:
Date: Tue, 26 Jun 2012 08:42:34 -0500
Subject: Re: [PERFORM] Can I do better than this heapscan and sort?
From: mmonc...@gmail.com
To: halsall_a...@hotmail.com
CC: pgsql-performance@postgresql.org
On Tue, Jun
On Thu, Jun 21, 2012 at 3:07 PM, Andy Halsall halsall_a...@hotmail.com wrote:
I have two tables node and relationship. Each relationship record connects
two nodes and has an application keys (unfortunately named) that can be used
by the application to look-up a relationship and get from one
On Tue, Jun 26, 2012 at 8:36 AM, Merlin Moncure mmonc...@gmail.com wrote:
On Thu, Jun 21, 2012 at 3:07 PM, Andy Halsall halsall_a...@hotmail.com
wrote:
I have two tables node and relationship. Each relationship record connects
two nodes and has an application keys (unfortunately named) that
I have two tables node and relationship. Each relationship record connects two
nodes and has an application keys (unfortunately named) that can be used by the
application to look-up a relationship and get from one node to the other.
My query uses a node id and a description of a relationship
