About: Elliptic Indexing of Multidimensional Databases

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Elliptic Indexing of Multidimensional Databases Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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	P Z
http://linked.open...avai/riv/aktivity	P(GA201/06/0756), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Skopal, Tomáš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	313034
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/09:00207420
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Elliptic; Indexing; Multidimensional; Databases (en)
http://linked.open.../riv/klicoveSlovo	Multidimensional Indexing Databases Elliptic
http://linked.open...ontrolniKodProRIV	[706F8E2E4A9A]
http://linked.open...v/mistoKonaniAkce	Neuveden
http://linked.open...i/riv/nazevZdroje	20th Australian Database Conference
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Development of a native storage for XML data
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Skopal, Tomáš Danko, Ondrej
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Australian Computer Society, CRPIT
https://schema.org/isbn	978-1-920682-73-6
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software