Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
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
| |
http://linked.open...avai/riv/aktivity
| |
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/61989100:27240/05:00012184
|
http://linked.open...riv/jazykVysledku
| |
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
| |
http://linked.open...i/riv/kodPristupu
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...telVyzkumneZpravy
| |
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
| - Snášel, Václav
- Skopal, Tomáš
- Krátký, Michal
- Pokorný, Jaroslav
|
http://localhost/t...ganizacniJednotka
| |