Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
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
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Stochastic screening dithering with adaptive clustering
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Algorithm 781: generating Hilbert's space-filling curve by recursion
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Irregularity in multi-dimensional space-filling curves with applications in multimedia databases
Proceedings of the tenth international conference on Information and knowledge management
Tuning Strassen's matrix multiplication for memory efficiency
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Performance of multi-dimensional space-filling curves
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
DOT: A Spatial Access Method Using Fractals
Proceedings of the Seventh International Conference on Data Engineering
High Dimensional Similarity Search With Space Filling Curves
Proceedings of the 17th International Conference on Data Engineering
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Filter Trees for Managing Spatial Data over a Range of Size Granularities
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Using Space-Filling Curves for Multi-dimensional Indexing
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
Scalable QoS-Aware Disk-Scheduling
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
On Multi-dimensional Hilbert Indexings
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
On Multi-dimensional Sorting Orders
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
Scalable Multimedia Disk Scheduling
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Robust B+-Tree-Based Indexing of Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Mapping Multidimensional Space to One Dimension for Computer Output Display
IEEE Transactions on Computers
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
IEEE Transactions on Knowledge and Data Engineering
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Private queries in location based services: anonymizers are not necessary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Using Peano Curves for Bilevel Display of Continuous-Tone Images
IEEE Computer Graphics and Applications
CudaGIS: report on the design and realization of a massive data parallel GIS on GPUs
Proceedings of the Third ACM SIGSPATIAL International Workshop on GeoStreaming
Hi-index | 0.00 |
A space-filling curve is a way of mapping the discrete multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the discrete multi-dimensional space so that every cell is visited exactly once. Thus, a space-filling curve imposes a linear order of the cells in the multi-dimensional space. There are numerous kinds of space-filling curves. The difference between such curves is in their way of mapping to the one-dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space-filling curve. Irregularity is proposed as a quantitative measure for the ordering quality imposed by space-filling curve mapping. The lower the irregularity the better the space-filling curve in preserving the order of the discrete multi-dimensional space. Five space-filling curves (the Sweep, Scan, Peano, Gray, and Hilbert) are analyzed with respect to irregularity. Closed formulas are developed to compute the irregularity in any dimension k for a D-dimensional space-filling curve with grid size N. A comparative study of different space-filling curves with respect to the irregularity is conducted and results are presented and discussed. We find out that for an application that is biased toward one of the dimensions, the Sweep or the Scan space-filling curves are the best choice. For high-dimensional applications, the Peano space-filling curve would be the best choice. For applications that require fairness among various dimensions, the Hilbert and Gray space-filling curves are the best choice.