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
rdfs:seeAlso	http://www.sciencedirect.com/science/journal/03064379
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 behaves efficiently, especially for high-dimensional databases.We explain the algorithm using a geometric model providing an intelligible insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quadtrees. We also present experimental results for the range query 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 behaves efficiently, especially for high-dimensional databases.We explain the algorithm using a geometric model providing an intelligible insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quadtrees. We also present experimental results for the range query algorithm implementation (en) 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 behaves efficiently, especially for high-dimensional databases.We explain the algorithm using a geometric model providing an intelligible insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quadtrees. We also present experimental results for the range query algorithm implementation (cs)
Title	A New Range Query Algorithm for Universal B-trees A New Range Query Algorithm for Universal B-trees (en) A New Range Query Algorithm for Universal B-trees (cs)
skos:prefLabel	A New Range Query Algorithm for Universal B-trees A New Range Query Algorithm for Universal B-trees (en) A New Range Query Algorithm for Universal B-trees (cs)
skos:notation	RIV/61989100:27240/05:00012184!RIV06-GA0-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA201/03/0912)
http://linked.open...vai/riv/dodaniDat	2006
http://linked.open...aciTvurceVysledku	Krátký, Michal Snášel, Václav
http://linked.open.../riv/druhVysledku	A(V) - Audiovizuální tvorba se vzdáleným přístupem
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	510961
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/05:00012184
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	Range query UB-tree DRU algorithm Multi-dimensional indexing Space filling curves Spatial access methods Z-region
http://linked.open...i/riv/kodPristupu	V
http://linked.open...ontrolniKodProRIV	[0565D5ABC2F5]
http://linked.open...i/riv/mistoVydani	Amsterdam
http://linked.open...telVyzkumneZpravy	Elsevier Amsterdam
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
http://linked.open...UplatneniVysledku	2005
http://linked.open...iv/tvurceVysledku	Snášel, Václav Skopal, Tomáš Krátký, Michal Pokorný, Jaroslav
http://localhost/t...ganizacniJednotka	27240

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, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software