R-tree indexes
HCL OneDB™ supports the R-tree index for columns that contain spatial data such as maps and diagrams. An R-tree index uses a tree structure whose nodes store pointers to lower-level nodes.
At the leaves of the R-tree are a collection of data pages that store n-dimensional shapes. For more information about the structure of an R-tree index and how to estimate the size of an R-tree index, see the R-Tree Index User's Guide.