Spacefilling curves and the planar travelling salesman problem
Journal of the ACM (JACM)
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Space diffusion: an improved parallel halftoning technique using space-filling curves
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Geometric searching with spacefilling curves
Geometric searching with spacefilling curves
Multi-way partitioning via spacefilling curves and dynamic programming
DAC '94 Proceedings of the 31st annual Design Automation Conference
Algorithm 781: generating Hilbert's space-filling curve by recursion
ACM Transactions on Mathematical Software (TOMS)
Recursive array layouts and fast parallel matrix multiplication
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Vertex-labeling algorithms for the Hilbert spacefilling curve
Software—Practice & Experience
ACM Computing Surveys (CSUR)
Increasing temporal locality with skewing and recursive blocking
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
International Journal of Parallel Programming
Partitioning Unstructured Computational Graphs for Nonuniform and Adaptive Environments
IEEE Parallel & Distributed Technology: Systems & Technology
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Video Scrambling Technique Based On Space Filling Curves
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Parallel Multi-Dimensional ROLAP Indexing
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
The number of bit comparisons used by Quicksort: an average-case analysis
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Engineering a Peer-to-Peer Collaboratory for Tissue Microarray Research
CLADE '04 Proceedings of the 2nd International Workshop on Challenges of Large Applications in Distributed Environments
Enabling Flexible Queries with Guarantees in P2P Systems
IEEE Internet Computing
SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
ACM Transactions on Mathematical Software (TOMS)
Alternative Algorithm for Hilbert's Space-Filling Curve
IEEE Transactions on Computers
Convergence with Hilbert's space filling curve
Journal of Computer and System Sciences
Reordering columns for smaller indexes
Information Sciences: an International Journal
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.89 |
In this paper we define a new compact Hilbert index which, while maintaining all of the advantages of the standard Hilbert curve, permits spaces with unequal dimension cardinalities. The compact Hilbert index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This advantage is particularly important in distributed applications (Parallel, P2P and Grid), in which not only is memory space saved but communication volume is significantly reduced.