Faster access than browser!
32 relations: B+ tree, B-tree, Best, worst and average case, Bounding volume hierarchy, Cluster analysis, Database, Geographic coordinate system, GiST, Great-circle distance, Hilbert R-tree, Intersection (set theory), Interval tree, K-nearest neighbors algorithm, Local outlier factor, Lp space, M-tree, Minimum bounding box, Minimum bounding rectangle, Navigation system, Nearest neighbor search, OPTICS algorithm, Polygon, Priority R-tree, R* tree, R+ tree, Range searching, Rectangle, Segment tree, Spatial database, Tree (data structure), VLDB, X-tree.
B+ tree
A B+ tree is an N-ary tree with a variable but often large number of children per node.
New!!: R-tree and B+ tree · See more »
B-tree
In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.
New!!: R-tree and B-tree · See more »
Best, worst and average case
In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively.
New!!: R-tree and Best, worst and average case · See more »
Bounding volume hierarchy
A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects.
New!!: R-tree and Bounding volume hierarchy · See more »
Cluster analysis
Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense) to each other than to those in other groups (clusters).
New!!: R-tree and Cluster analysis · See more »
Database
A database is an organized collection of data, stored and accessed electronically.
New!!: R-tree and Database · See more »
Geographic coordinate system
A geographic coordinate system is a coordinate system used in geography that enables every location on Earth to be specified by a set of numbers, letters or symbols.
New!!: R-tree and Geographic coordinate system · See more »
GiST
In computing, GiST or Generalized Search Tree, is a data structure and API that can be used to build a variety of disk-based search trees.
New!!: R-tree and GiST · See more »
Great-circle distance
The great-circle distance or orthodromic distance is the shortest distance between two points on the surface of a sphere, measured along the surface of the sphere (as opposed to a straight line through the sphere's interior).
New!!: R-tree and Great-circle distance · See more »
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 objects.
New!!: R-tree and Hilbert R-tree · See more »
Intersection (set theory)
In mathematics, the intersection A ∩ B of two sets A and B is the set that contains all elements of A that also belong to B (or equivalently, all elements of B that also belong to A), but no other elements.
New!!: R-tree and Intersection (set theory) · See more »
Interval tree
In computer science, an interval tree is a tree data structure to hold intervals.
New!!: R-tree and Interval tree · See more »
K-nearest neighbors algorithm
In pattern recognition, the k-nearest neighbors algorithm (k-NN) is a non-parametric method used for classification and regression.
New!!: R-tree and K-nearest neighbors algorithm · See more »
Local outlier factor
In anomaly detection, the local outlier factor (LOF) is an algorithm proposed by Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng and Jörg Sander in 2000 for finding anomalous data points by measuring the local deviation of a given data point with respect to its neighbours.
New!!: R-tree and Local outlier factor · See more »
Lp space
In mathematics, the Lp spaces are function spaces defined using a natural generalization of the ''p''-norm for finite-dimensional vector spaces.
New!!: R-tree and Lp space · See more »
M-tree
M-trees are tree data structures that are similar to R-trees and B-trees.
New!!: R-tree and M-tree · See more »
Minimum bounding box
In geometry, the minimum or smallest bounding or enclosing box for a point set (S) in N dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie.
New!!: R-tree and Minimum bounding box · See more »
Minimum bounding rectangle
The minimum bounding rectangle (MBR), also known as bounding box or envelope, is an expression of the maximum extents of a 2-dimensional object (e.g. point, line, polygon) or set of objects within its (or their) 2-D (x, y) coordinate system, in other words min(x), max(x), min(y), max(y).
New!!: R-tree and Minimum bounding rectangle · See more »
Navigation system
A navigation system is a (usually electronic) system that aids in navigation.
New!!: R-tree and Navigation system · See more »
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 similar) to a given point.
New!!: R-tree and Nearest neighbor search · See more »
OPTICS algorithm
Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data.
New!!: R-tree and OPTICS algorithm · See more »
Polygon
In elementary geometry, a polygon is a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed polygonal chain or circuit.
New!!: R-tree and Polygon · See more »
Priority R-tree
The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree.
New!!: R-tree and Priority R-tree · See more »
R* tree
In data processing R*-trees are a variant of R-trees used for indexing spatial information.
New!!: R-tree and R* tree · See more »
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.
New!!: R-tree and R+ tree · See more »
Range searching
In data structures, the range searching problem most generally consists of preprocessing a set S of objects, in order to determine which objects from S intersect with a query object, called a range.
New!!: R-tree and Range searching · See more »
Rectangle
In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles.
New!!: R-tree and Rectangle · See more »
Segment tree
In computer science, a segment tree also known as a statistic tree is a tree data structure used for storing information about intervals, or segments.
New!!: R-tree and Segment tree · See more »
Spatial database
A spatial database is a database that is optimized for storing and querying data that represents objects defined in a geometric space.
New!!: R-tree and Spatial database · See more »
Tree (data structure)
In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
New!!: R-tree and Tree (data structure) · See more »
VLDB
VLDB is an annual conference held by the non-profit Very Large Data Base Endowment Inc. The mission of VLDB is to promote and exchange scholarly work in databases and related fields throughout the world.
New!!: R-tree and VLDB · See more »
X-tree
In computer science, an X-tree (for eXtended node tree) is an index tree structure based on the R-tree used for storing data in many dimensions.
New!!: R-tree and X-tree · See more »
Redirects here:
R Tree, R Trees, R tree, R-Tree, Rtree.
References
[1] https://en.wikipedia.org/wiki/R-tree
