Keywords
Theory of computationData structureComputer scienceLogarithmTree (set theory)Search treeAlgorithmR-treeTree structureTheoretical computer scienceMathematicsSearch algorithmCombinatoricsStatisticsSpatial analysis
Affiliated Institutions
Related Publications
An Algroithm for Finding Best Matches in Logarithmic Expected Time
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to ...
The K-D-B-tree
The problem of retrieving multikey records via range queries from a large, dynamic index is considered. By large it is meant that most of the index must be stored on secondary m...
IQPNNI: Moving Fast Through Tree Space and Stopping in Time
An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast al...
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in mult...
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned web-search ranking - a domain notorious for very large data sets....
Publication Info
- Year
- 1974
- Type
- article
- Volume
- 4
- Issue
- 1
- Pages
- 1-9
- Citations
- 1984
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1984
OpenAlex
Cite This
Raphael A. Finkel,
Jon Bentley
(1974).
Quad trees a data structure for retrieval on composite keys.
Acta Informatica
, 4
(1)
, 1-9.
https://doi.org/10.1007/bf00288933
Identifiers
- DOI
- 10.1007/bf00288933