Attributes | Values |
---|
rdf:type
| |
Description
| - 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, el- lipsoid as a quadratic surface should cover data more tightly, leading to less dead space coverage and less overlaps. Based on studies of many available R-tree variants (especially SR-tree), the eR-tree (ellipsoid R-tree) with ellipsoidal regions is proposed. The fo- cus is put on the algorithm of ellipsoids construction as it significantly aspects indexing speed and querying performance. At the end, the eR-tree undergoes ex- periments with both synthetic and real datasets. It proves its superiority especially on clustered sparse datasets.
- 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, el- lipsoid as a quadratic surface should cover data more tightly, leading to less dead space coverage and less overlaps. Based on studies of many available R-tree variants (especially SR-tree), the eR-tree (ellipsoid R-tree) with ellipsoidal regions is proposed. The fo- cus is put on the algorithm of ellipsoids construction as it significantly aspects indexing speed and querying performance. At the end, the eR-tree undergoes ex- periments with both synthetic and real datasets. It proves its superiority especially on clustered sparse datasets. (en)
|
Title
| - Elliptic Indexing of Multidimensional Databases
- Elliptic Indexing of Multidimensional Databases (en)
|
skos:prefLabel
| - Elliptic Indexing of Multidimensional Databases
- Elliptic Indexing of Multidimensional Databases (en)
|
skos:notation
| - RIV/00216208:11320/09:00207420!RIV10-GA0-11320___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA201/06/0756), Z(MSM0021620838)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/09:00207420
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Elliptic; Indexing; Multidimensional; Databases (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/nazevZdroje
| - 20th Australian Database Conference
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Skopal, Tomáš
- Danko, Ondrej
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - Australian Computer Society, CRPIT
|
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |