Greg Stark <gsstark@mit.edu> writes:
> Tom Lane <tgl@sss.pgh.pa.us> writes:
>> I think you could do something involving a time interval datatype that
>> considers "overlap" as equality and does something reasonable for
>> sorting non-overlapping intervals.
> How could a non-transitive property ever be merge joinable though?
Um, good point. So it couldn't be "overlaps" in the normal sense of the
word. But given that he's mostly concerned about cases where one end is
+infinity, it might be possible to devise a consistent semantics that
works.
regards, tom lane
