Page usage in a quadtree index
Open Access
- 1 September 1992
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 32 (3) , 384-402
- https://doi.org/10.1007/bf02074876
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An Analysis of Randomd-Dimensional Quad TreesSIAM Journal on Computing, 1990
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- Analysis of the space of search trees under the random insertion algorithmJournal of Algorithms, 1989
- Transforming Unbalanced Multiway trees into a practical external data structureActa Informatica, 1988
- Partial match retrieval of multidimensional dataJournal of the ACM, 1986
- Ramanujan’s NotebooksPublished by Springer Nature ,1985
- On the performance evaluation of extendible hashing and trie searchingActa Informatica, 1983
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974