Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A comparison of spatial query processing techniques for native and parameter spaces
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Integrating the UB-Tree into a Database System Kernel
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
On the metric properties of discrete space-filling curves
IEEE Transactions on Image Processing
On support of ordering in multidimensional data structures
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
| Hi-index | 0.00 |
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.