Querying multi-dimensional data indexed using the Hilbert space-filling curve

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 1, 2001, Pages 19-24

  Lawder, J K ^a   King, P J H ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010277904     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/373626.373678     Document Type: Article

References (17)

1. T. Bially. Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction. IEEE Transactions on Information Theory, IT-15(6):658-664, Nov 1969.
2. A.R. Butz. Alternative Algorithm for Hilbert's Space-Filling Curve. IEEE Transactions on Computers, 20:424-426, April 1971.
3. C. Faloutsos. Gray Codes for Partial Match and Range Queries. IEEE Transactions on Software Engineering, 14(10):1381-1393, Oct 1988.
4. C. Faloutsos and S. Roseman. Fractals for Secondary Key Retrieval. Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 247-252, 1989.
5. V. Gaede and O. Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2): 170-231, June 1998.
6. D. Hilbert. Ueber stetige Abbildung einer Linie auf ein Flachenstuck. Mathematische Annalen, 38:459-460 1891.
7. H.V. Jagadish. Linear Clustering of Objects with Multiple Atributes. Procs. of the 1990 ACM SIGMOD Int. Conf. on Management of Data, 19(2):332-342 1990.
8. H.V. Jagadish. Analysis of the Hilbert curve for representing two-dimensional space. Information Processing Letters, 62(1):17-22, April 1997.
9. A. Kumar. A Study of Spatial Clustering Techniques. In: Procs. of the 5th Int. Conf. on Database and Expert Systems Applications (DEXA '94), vol 856, Lecture Notes in Computer Science, pages 57-71, Sept 1994.
10. J.K. Lawder. The Application of Space-Filling Curves to the Storage and Retrieval of Multi-dimensional Data. PhD thesis, Birkbeck College, University of London, 2000.
11. J.K. Lawder and P. J. H. King. Using Space-Filling Curves for Multi-dimensional Indexing. In: Advances in Databases, 17th British National Conference on Databases (BNCOD 17), vol 1832, Lecture Notes in Computer Science, pages 20-35, July 2000.
12. J.K. Lawder. Calculation of Mappings between One and n-dimensional Values Using the Hilbert Space-Filling Curve. Technical Report JL1/00, Birkbeck College, University of London, 2000.
13. J.K. Lawder. Using State Diagrams for Hubert Curve Mappings. Technical Report JL2/00, Birkbeck College, University of London, 2000.
14. B. Moon and H.V. Jagadish and C. Faloutsos and J.H. Saltz. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. Technical Report 99-10, University of Arizona, 1999.
15. J.A. Orenstein and F.A. Manola. PROBE: Spatial Data Modeling and Query Processing in an Image Database Application. IEEE Transactions on Software Engineering, 14(5):611-629, 1988.
16. F. Ramsak, V. Markl, R. Fenk, K. Elhardt and R. Bayer. Integrating the UB-Tree into a Database System Kernel. In: Procs. of the 26th Int. Conf. on Very Large Databases, pages 263-272, 2000
17. H. Tropf and H. Herzog. Multi-dimensional Range Search in Dynamically Balanced Trees. Angewandte Informatik, 23(2):71-77, 1981.