Skip to search formSkip to main contentSkip to account menu

R-tree

Known as: R Tree, R Trees, Rtree 
R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
As multiple service providers may compete to offer the same functionality with different quality of service (e.g., latency, fee… 
2008
2008
An outlier is the object which is very different from the rest of the dataset on some measure. Finding such exception has… 
2008
2008
We address the problem of optimizing the maintenance of continuous queries in Moving Objects Databases, when a set of pending… 
2007
2007
AbstractThe reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which… 
2003
2003
Abstract.This paper presents a new approach for content-based image retrieval, which is based on the well-known and widely used… 
1996
1996
k-RP*s is a new data structure for scalable multicomputer files with multi-attribute (k-d) keys. We discuss the k-RP*s file…