Tom Lane wrote:
It'd need to be
S &< T iff inf(S) <= sup(T)
to satisfy the geometrical intuition. (You could quibble about the
equality case, but box_overlap seems to consider touching boxes to
overlap, so for consistency this should too.)
However, if this is indeed wrong, why have we not hear
Tom Lane wrote:
Good point. You can force it by setting enable_seqscan to false, but
otherwise it's unlikely to happen.
Ah, didn't know about enable_seqscan, thanks.
It seems to me that the operator rtree actually wants is best thought of
as "is not to right of" (resp. "is not to left of"). The
Tom Lane wrote:
Right, but what about the existing operators --- what is a more correct
way to document them?
Ouch.
Appealing to J.F. Allen's terminology ("An Interval-Based Representation
of Temporal Knowledge", Comm ACM 26(11) 832-43), overleft could be
called "left or finishes" (implying all
Trilobite Trilobite wrote:
Anyway, there are a few things in our database that are more hierarchal
then they are relational. The problem I'm working with is accounting,
as in, "accounts > owners equity > expense accounts > rent > shop rent"
etc... I have no idea how many accounts the end user
Jeff Davis wrote:
Anyway, it occured to me that I could create a special file for each
database user of limited size, and make a filesystem on top of that
file. The file could be owned by the user. Then, each user could have a
seperate database and that database would be at the location of the
moun
