From: | "David G(dot) Johnston" <david(dot)g(dot)johnston(at)gmail(dot)com> |
---|---|
To: | Andreas Joseph Krogh <andreas(at)visena(dot)com> |
Cc: | "pgsql-sql(at)postgresql(dot)org" <pgsql-sql(at)postgresql(dot)org> |
Subject: | Re: GROUP BY overlapping (tsrange) entries |
Date: | 2016-01-30 00:34:42 |
Message-ID: | CAKFQuwY2ufhz5c1KM6Cypcog=0zKqfiirkW7GS7V0VFMeehkxw@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
On Fri, Jan 29, 2016 at 4:34 PM, Andreas Joseph Krogh <andreas(at)visena(dot)com>
wrote:
> På fredag 29. januar 2016 kl. 20:23:01, skrev David G. Johnston <
> david(dot)g(dot)johnston(at)gmail(dot)com>:
>
> The only other potential query approach that comes to mind is some kind of
> recursive CTE.
>
>
> Interesting. Care to give an example of how to solve this using recursive
> CTE?
>
My skill with recursive CTEs is abyssmal, so no, that is not a challenge
that I wish to take on at this time. I'm not positive there is a
meaningful one to even be had but the idea of choosing a parent time and
then either expanding its covered range or adding a child is at least
compelling enough to make it worth exploring if current solutions are
undesirable.
David J.
From | Date | Subject | |
---|---|---|---|
Next Message | Misa Simic | 2016-01-30 12:45:11 | Re: GROUP BY overlapping (tsrange) entries |
Previous Message | Michael Moore | 2016-01-30 00:20:08 | Re: GROUP BY overlapping (tsrange) entries |