Martin Pfeifle wrote:
Hello Noel,
I think you can find more information on the computation of the upper hull values in
[FFS00] "Implementing Geospatial Operations in an Object-Relational Database
System".
Yes I'm already reading that.
For testing, we used oracle, where we had transient t
Hello Noel,
I think you can find more information on the computation of the upper hull
values in [FFS00] "Implementing Geospatial Operations in an Object-Relational
Database System".
For testing, we used oracle, where we had transient tables.
I am not sure whether we have transient memory tables
Martin Pfeifle wrote:
Hi,
the baisc idea of the Relational R-tree is to map the hierarchical relationship
between the R-tree nodes to a (father, son) relation where a b-tree is on
father. You can the traverse the relation preferable using recursive SQL, if
not available, you have to do it on
Hi,
the baisc idea of the Relational R-tree is to map the hierarchical relationship
between the R-tree nodes to a (father, son) relation where a b-tree is on
father. You can the traverse the relation preferable using recursive SQL, if
not available, you have to do it on your own.
The Idea of the
4 matches
Mail list logo
