Ondrej Danko

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which determine R-tree index structure performance, is an amount of dead space coverage and overlaps among the covering regions. Intuitively, ellipsoid as a quadratic surface should cover(More)
  • 1