. "4"^^ . . "Sn\u00E1\u0161el, V\u00E1clav" . "Elsevier Amsterdam" . "P(GA201/03/0912)" . . "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 . "Skopal, Tom\u00E1\u0161" . . . "2"^^ . "Kr\u00E1tk\u00FD, Michal" . . . "A New Range Query Algorithm for Universal B-trees"@en . . "RIV/61989100:27240/05:00012184" . . "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" . "A New Range Query Algorithm for Universal B-trees"@cs . "510961" . . "A New Range Query Algorithm for Universal B-trees"@cs . "[0565D5ABC2F5]" . "Pokorn\u00FD, Jaroslav" . . "Spatial access methods; Multi-dimensional indexing; Range query; UB-tree; DRU algorithm; Z-region; Space filling curves"@en . . . "RIV/61989100:27240/05:00012184!RIV06-GA0-27240___" . . . . . "A New Range Query Algorithm for Universal B-trees"@en . "Amsterdam" . "27240" . "http://www.sciencedirect.com/science/journal/03064379" . "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 . . "A New Range Query Algorithm for Universal B-trees" . . . "A New Range Query Algorithm for Universal B-trees" . .