Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Recursive 3D Mesh Indexing with Improved Locality
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Towards Optimal Locality in Mesh-Indexings
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Convergence with Hilbert's space filling curve
Journal of Computer and System Sciences
On the metric properties of discrete space-filling curves
IEEE Transactions on Image Processing
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
Bulk loading hierarchical mixture models for efficient stream classification
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
On sampling in higher-dimensional peer-to-peer systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
Indexing schemes for grids based on space-filling curves (e.g., Hilbert indexings) find applications in numerous fields. Hilbert curves yield the most simple and popular scheme. We extend the concept of curves with Hilbert property to arbitrary dimensions and present first results concerning their structural analysis that also simplify their applicability. As we show, Hilbert indexings can be completely described and analyzed by "generating elements of order 1", thus, in comparison with previous work, reducing their structural complexity decisively.