Linear clustering of objects with multiple attributes
- 1 May 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 19 (2) , 332-342
- https://doi.org/10.1145/93605.98742
Abstract
There is often a need to map a multi-dimensional space on to a one-dimensional space. For example, this kind of mapping has been proposed to permit the use of one-dimensional indexing techniques to a multi-dimensional index space such as in a spatial database. This kind of mapping is also of value in assigning physical storage, such as assigning buckets to records that have been indexed on multiple attributes, to minimize the disk access effort.In this paper, we discuss what the desired properties of such a mapping are, and evaluate, through analysis and simulation, several mappings that have been proposed in the past. We present a mapping based on Hilbert's space-filling curve, which out-performs previously proposed mappings on average over a variety of different operating conditions.Keywords
This publication has 16 references indexed in Scilit:
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- Fractals for secondary key retrievalPublished by Association for Computing Machinery (ACM) ,1989
- Gray codes for partial match and range queriesIEEE Transactions on Software Engineering, 1988
- Multiattribute hashing using Gray codesPublished by Association for Computing Machinery (ACM) ,1986
- The Grid FileACM Transactions on Database Systems, 1984
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- A class of data structures for associative searchingPublished by Association for Computing Machinery (ACM) ,1984
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Alternative Algorithm for Hilbert's Space-Filling CurveIEEE Transactions on Computers, 1971
- Ueber die stetige Abbildung einer Line auf ein Fl chenst ckMathematische Annalen, 1891