Irregularity in multi-dimensional space-filling curves with applications in multimedia databases
Proceedings of the tenth international conference on Information and knowledge management
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
ACM Transactions on Mathematical Software (TOMS)
Neighbor-finding based on space-filling curves
Information Systems
New challanges in dynamic load balancing
Applied Numerical Mathematics - Adaptive methods for partial differential equations and large-scale computation
Efficiently processing queries on interval-and-value tuples in relational databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A new range query algorithm for universal B-trees
Information Systems
Spatial ordering and encoding for geographic data mining and visualization
Journal of Intelligent Information Systems
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths
Information Processing Letters
CLAM: concurrent location management for moving objects
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
How to Use SIFT Vectors to Analyze an Image with Database Templates
Adaptive Multimedial Retrieval: Retrieval, User, and Semantics
Mathematics and Computers in Simulation
Query Integrity Assurance of Location-Based Services Accessing Outsourced Spatial Databases
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Tailoring service discovery to embedded P2P systems
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
New challenges in dynamic load balancing
Applied Numerical Mathematics - Adaptive methods for partial differential equations and large-scale computation
Enabling ε-approximate querying in sensor networks
Proceedings of the VLDB Endowment
Efficient processing of spatial joins with DOT-based indexing
Information Sciences: an International Journal
Robust content-based video copy identification in a large reference database
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
Location privacy in geospatial decision-making
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Efficient integration of structure indexes of XML
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
A new adaptive mesh refinement data structure with an application to detonation
Journal of Computational Physics
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
All-nearest-neighbors finding based on the Hilbert curve
Expert Systems with Applications: An International Journal
Identifying points of interest by self-tuning clustering
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
An extendible array based implementation of relational tables for multi dimensional databases
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Distributed and Parallel Databases
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Two mechanisms for generating infinite families of pairing bijections
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.01 |
Mapping to one-dimensional values and then using a one-dimensional indexing method has been proposed as a way of indexing multi-dimensional data. Most previous related work uses the Z-Order Curve but more recently the Hilbert Curve has been considered since it has superior clustering properties. Any approach, however, can only be of practical value if there are effective methods for executing range and partial match queries. This paper describes such a method for the Hilbert Curve.