Using space-filling curves for multi-dimensional indexing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1832, Issue , 2000, Pages 20-35

  Lawder, J K ^a   King, P ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION);

ACTUAL USE; COMPARATIVE PERFORMANCE; GRID FILES; MULTI-DIMENSIONAL INDEXING; NOVEL ALGORITHM; SPACE-FILLING CURVE; TRIPLE STORE;

DATABASE SYSTEMS;

EID: 84957796272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45033-5_3     Document Type: Conference Paper

References (17)

1. Theodore 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. Arthur R. Butz. Alternative Algorithm for Hilbert's Space-Filling Curve. IEEE Transactions on Computers, 20:424-426, April 1971.
3. Mir Derakhshan. A Development of the Grid File for the Storage of Binary Relations. PhD thesis, Birkbeck College, University of London, 1989.
4. Christos Faloutsos and Shari Roseman. Fractals for Secondary Key Retrieval. Technical Report UMIACS-TR-89-47, University of Maryland, 1989. http://www.cs.cmu.edu/ christos/cpub.html.
5. Christos Faloutsos and Yi Rong. DOT: A Spatial Access Method Using Fractals. In: Proceedings of the Seventh International Conference on Data Engineering, April 8-12, 1991, Kobe, Japan, pages 152-159. IEEE Computer Society.
6. M. Freeston. The BANG File: A New Kind of Grid File. In: Umeshwar Dayal and Irving L. Traiger (eds): Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data Annual Conference, May 27-29, 1987, San Francisco, California, pages 260-269. ACM Press.
7. Volker Gaede and Oliver Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2):170-231, June 1998.
8. Antonin Guttman, R Trees: A Dynamic Index Structure for Spatial Seaching. In: SIGMOD '84: Proceedings of the Annual Meeting, volume 14(2) of SIGMOD Record, pages 47-57. ACM, 1984.
9. David Hilbert. Ueber stetige Abbildung einer Linie auf ein Flachenstuck. Mathe-matische Annalen. 38:459-460, 1891.
10. H.V. Jagadish. Analysis of the Hilbert curve for representing two-dimensional space. Information Processing Letters, 62(1):17-22, April 1997.
11. Akhil Kumar. A Study of Spatial Clustering Techniques. In: Dimitris Karagiannis (ed): Proceedings of the 5th International Conference on Database and Expert Systems Applications (DEXA '94), volume 856 of Lecture Notes in Computer Science, pages 57-71. Springer-Verlag, Sept 1994.
12. Jonathan Lawder. The Application of Space-Filling Curves to the Storage and Retrieval of Multi-dimensional Data (Submitted for PhD). Technical Report JL/1/99, Birkbeck College, University of London, 1999.
13. Bongki Moon and H.V. Jagadish and Christos Faloutsos and Joel H. Saltz. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. Technical Report CS-TR-3611/UMIACS-TR-96-20, University of Maryland, 1996.
14. Jürg Nievergelt and Hans Hinterberger and Kenneth C. Sevcik. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Transactions on Database Systems (TODS), 9(1):38-71, 1984.
15. Jack 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. Giuseppe Peano. Sur une courbe, qui remplit toute une aire plane (On a curve which completely fills a planar region). Mathematische Annalen, 36:157-160, 1890.
17. Hans Sagan. Space-Filling Curves. Springer-Verlag, 1994.