Everything about R-tree
Data structures used in spatial indexing
R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons. The R-tree was proposed by Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts. A common real-world usage for an R-tree might be to store spatial objects such as restaurant locations or the polygons that typical maps are made of: streets, buildings, outlines of lakes, coastlines, etc. and then find answers quickly to queries such as "Find all museums within 2 km of my current location", "retrieve all road segments within 2 km of my location" or "find the nearest gas station". The R-tree can also accelerate nearest neighbor search for various distance metrics, including great-circle distance. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: R-treeA 5-minute orientation
- Skim a recent paper: Interactive Tree of Life (iTOL) v6: recent updates to the phylogenetic tree display and annotation toolInfluential work since 2022
- Pick up a classic book: Farquhar's garden annualThe most-reprinted book on the subject
- Read the landmark paper: IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood PhylogeniesCited 25,767 times
- Go sideways: R*-treeA closely related topic
- Go sideways: Hilbert R-treeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
IQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era
Mastering the game of Go with deep neural networks and tree search
Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation
STRING v10: protein–protein interaction networks, integrated over the tree of life
z-Tree: Zurich toolbox for ready-made economic experiments
A global overview of drought and heat-induced tree mortality reveals emerging climate change risks for forests
The automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations
🆕 Influential since 2022
Interactive Tree of Life (iTOL) v6: recent updates to the phylogenetic tree display and annotation tool
Tree Visualization By One Table (tvBOT): a web application for visualizing, modifying and annotating phylogenetic trees
A DNA barcoding framework for taxonomic verification in the Darwin Tree of Life Project
Greengenes2 unifies microbial data in a single reference tree
Exploring and retrieving sequence and metadata for species across the tree of life with NCBI Datasets
📚 Books worth reading
Farquhar's garden annualR. & J. Farquhar Company · 1905
The Wild TreesRichard Preston, Richard Preston · 2007
Farquhar's catalogueR. & J. Farquhar Company · 1903
Farquhar's garden annualR. & J. Farquhar Company · 1908
Flora of Middle-EarthWalter S. Judd · 2017
Classification and regression treesLeo Breiman · 1993
Guide to the vegetable and flower garden and catalogue of flower, vegetable, agricultural and tree seeds, flowering bulbs, fruit and ornamental trees, flowering plants and shrubs for sale by R. J. TrumbullR.J. Trumbull (Firm) · 1873- 📕The Elizabeth R. Dean FundJohn Blum · 1981
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- R*-tree In data processing R*-trees are a variant of R-trees used for indexing spatial information. R*-trees have slightly higher construction cost than standard…
- Hilbert R-tree Hilbert R-tree, an R-tree variant, is an index for multidimensional objects such as lines, regions, 3-D objects, or high-dimensional feature-based parametric…
- K-d tree Wikimedia Commons has media related to k-d trees. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure…
- M-tree In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle…
- R+ tree An R+ tree is a method for looking up data using a location, often (x, y) coordinates, and often for locations on the surface of the Earth. Searching on…
- Ball tree In computer science, a ball tree, balltree or metric tree, is a space partitioning data structure for organizing points in a multi-dimensional space. A…
- Nearest neighbor search Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most…
- Vantage-point tree A vantage-point tree (or VP tree) is a metric tree that segregates data in a metric space by choosing a position in the space (the "vantage point") and…