About: A New Range Query Algorithm for Universal B-trees

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

About: A New Range Query Algorithm for Universal B-trees 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 multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in Universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation. In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in Universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation. (en)
Title	A New Range Query Algorithm for Universal B-trees A New Range Query Algorithm for Universal B-trees (en)
skos:prefLabel	A New Range Query Algorithm for Universal B-trees A New Range Query Algorithm for Universal B-trees (en)
skos:notation	RIV/61989100:27240/06:00021161!RIV11-GA0-27240___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/03/0912), P(GA201/06/0756), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika	6
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Krátký, Michal Snášel, Václav
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	463663
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/06:00021161
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	spatial access methods, multi-dimensional indexing, range query, UB-tree, DRU algorithm, Z-region, space filling curves (en)
http://linked.open.../riv/klicoveSlovo	UB-tree multi-dimensional indexing space filling curves spatial access methods DRU algorithm range query Z-region
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[A62F3EE4DCDA]
http://linked.open...i/riv/nazevZdroje	Information Systems
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	XML documents searching and indexing Development of a native storage for XML data
http://linked.open...UplatneniVysledku	2006
http://linked.open...v/svazekPeriodika	31
http://linked.open...iv/tvurceVysledku	Snášel, Václav Skopal, Tomáš Krátký, Michal Pokorný, Jaroslav
http://linked.open...ain/vavai/riv/wos	000238591200004
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	0306-4379
number of pages	22 (xsd:int)
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	A New Range Query Algorithm for Universal B-trees

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