Balanced multidimensional extendible hash tree
- 1 June 1985
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 100-113
- https://doi.org/10.1145/6012.6015
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Analysis of grid file algorithmsBIT Numerical Mathematics, 1985
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- The Grid FileACM Transactions on Database Systems, 1984
- On the performance evaluation of extendible hashing and trie searchingActa Informatica, 1983
- Dynamic multi-dimensional data structures based on quad- and k—d treesActa Informatica, 1982
- The extendible cell method for closest point problemsBIT Numerical Mathematics, 1982
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974
- Organization and maintenance of large ordered indexesActa Informatica, 1972