1990 · 413 citations · 19 references
ComputingComputer ScienceData StructuresDatabasesStorage SystemsData Storage SystemsData Structure AlgorithmsSpatial Data StructuresSpatial Database SystemsSpatial DatabasesSpatial PartitioningAttributesClusteringIndex StructuresMultidimensional IndexingSpatial Data StorageSpatial Database StructuresSpatial IndexingStorage
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.
19
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik · ACM Transactions on Database Systems · 1984 · 1.1K citations · Full text
Extendible hashing—a fast access method for dynamic files
Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger et al. · ACM Transactions on Database Systems · 1979 · 669 citations · Full text