Benchmarking the UB-tree

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F03%3A00008375" target="_blank" >RIV/61989100:27240/03:00008375 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Benchmarking the UB-tree

Original language description

In the area of multidimensional databases, the UB-tree represents a promising indexing structure. A key feature of any multidimensional indexing structure is its ability to effectively perform the range queries. In the case of UB-trees, we have proposedan advanced range query algorithm making possible to operate on indices of high dimensionality. In this paper we present experimental results of this range query algorithm.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F03%2F0912" target="_blank" >GA201/03/0912: XML documents searching and indexing</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of DATESO 2003

ISBN

ISBN 80-248-033

ISSN

—

e-ISSN

—

Number of pages

12

Pages from-to

82-93

Publisher name

VŠB - Technická univerzita Ostrava

Place of publication

Ostrava

Event location

Desná

Event date

Jan 1, 2003

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—