split node
1Split (disambiguation) — Split is the largest coastal city in Croatia.From its common usage to refer to a division of parts, split may also refer to:Arts and entertainment* A split (poker), dividing of winnings in the card game * A split (ten pin bowling) where multiple… …
2разделенный узел схемы — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN split node …
3B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… …
4Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… …
5AA tree — In computer science, AA trees (Arne Andersson trees) are a form of balanced trees used for storing and retrieving ordereddata efficiently.Unlike red black trees, red nodes on an AA tree can only be added as a right subchild. In other words, no… …
6Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful …
7Árbol AA — En informática un árbol AA es un tipo de árbol binario de búsqueda auto balanceable utilizado para almacenar y recuperar información ordenada de manera eficiente. Los árboles AA reciben el nombre de su inventor, Arne Andersson. Los árboles AA son …
8Content addressable network — The Content Addressable Network (CAN) is a distributed, decentralized P2P infrastructure that provides hash table functionality on an Internet like scale. CAN was one of the original four distributed hash table proposals, introduced concurrently… …
9Top Trees — The Top Tree is a binary tree based data structure for unrooted dynamic trees which is used mainly for carrying out various path related operations, it allows simple Divide and conquer algorithms. It has since been augmented to maintain… …
10Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams …
