Overview

R-Tree


'R-Tree' can also refer to...

R-Tree

R-Tree

Phybase: an R package for species tree analysis

Defining clusters from a hierarchical cluster tree: the Dynamic Tree Cut package for R

The Tree of Commonwealth, 1450–1793, Whitney R. D. Jones

Characterization of Mixing in Quotients of R‐Trees

node.dating: dating ancestors in phylogenetic trees in R

Exploring trees in three dimensions: VoxR, a novel voxel-based R package dedicated to analysing the complex arrangement of tree crowns

On Approximate Algorithms for Distance-Based Queries using R-trees

Heartwood and sapwood variation in Acacia melanoxylon R. Br. trees in Portugal

The Manuscript of M. R. James’s ‘The Ash-Tree’

Subgroup 4 R2R3-MYBs in conifer trees: gene family expansion and contribution to the isoprenoid- and flavonoid-oriented responses

TESS: an R package for efficiently simulating phylogenetic trees and performing Bayesian inference of lineage diversification rates

Haustorial Development and Growth Benefit to Seedlings of the Root Hemiparasitic Tree Nuytsia floribunda(Labill.) R.Br. in Association with Various Hosts

Haustorial Structure and Functioning of the Root Hemiparastic Tree Nuytsia floribunda(Labill.) R.Br. and Water Relationships with its Hosts

ESPRIT-Tree: hierarchical clustering analysis of millions of 16S rRNA pyrosequences in quasilinear computational time

The Impact of rRNA Secondary Structure Consideration in Alignment and Tree Reconstruction: Simulated Data and a Case Study on the Phylogeny of Hexapods

Whitney R. D. Jones. The Tree of Commonwealth, 1450–1793. Cranbury, N.J.: Fairleigh Dickinson University Press. 2000. Pp. 394. $60.00

Martin, R. 2005. Tree-Kangaroos of Australia and New Guinea. CSIRO Publishing, Collingwood, Australia, 158 pp. ISBN 10: 0-643-09072-X, price (paper) $37.95

 

More Like This

Show all results sharing this subject:

  • Computing

GO

Show Summary Details

Quick Reference

A data structure for storing and querying spatial data. Similar to B-trees in organization and operation, R-Trees store location information at each node in the form of minimum bounding rectangles (MBR). At a leaf node this describes the boundaries of the object defined in that node; at a non-leaf nodes this describe the MBR that will contain all the MBRs of that node's children. It does not matter if the spaces described by MBRs of separate nodes overlap. Searches for objects within a specified area can use the MBR information to confine the search efficiently to possible targets by excluding quickly all objects that cannot fall within the area. R-Trees are thus useful for large databases where the time to retrieve data from backing store is significant.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.