National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Eliptic indexing of multidimensional databases
Danko, Ondrej ; Skopal, Tomáš (advisor) ; Hoksza, David (referee)
In this work variation of R-tree, which hierarchically partition indexed space using minimum volume covering ellipsoids (MVCE) instead of usually used minimum bounding rectangles, is presented. Main aspects, which determine R-tree index structure performance, are studied from the available resources at the beginning. Base on this studies "e-Rtree" (ellipsoid R-tree) is designed. Afterward algorithms of MVCE construction are carefully analyzed, as the choice of the algorithm is crucial for the efficiency of indexing and retrieval. At the end of the work, eR-tree implementation over ATOM framework is presented along with experiments done on synthetic and real data sets.
Eliptic indexing of multidimensional databases
Danko, Ondrej ; Hoksza, David (referee) ; Skopal, Tomáš (advisor)
In this work variation of R-tree, which hierarchically partition indexed space using minimum volume covering ellipsoids (MVCE) instead of usually used minimum bounding rectangles, is presented. Main aspects, which determine R-tree index structure performance, are studied from the available resources at the beginning. Base on this studies "e-Rtree" (ellipsoid R-tree) is designed. Afterward algorithms of MVCE construction are carefully analyzed, as the choice of the algorithm is crucial for the efficiency of indexing and retrieval. At the end of the work, eR-tree implementation over ATOM framework is presented along with experiments done on synthetic and real data sets.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.