computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with...

structure is the interval tree. A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time. Segment trees support searching...

should be traversed. See also interval tree, which is a 1-dimensional special case. It is also possible to define a k-d tree with points stored solely in...

query performance. Priority R-tree Segment tree Interval tree – A degenerate R-tree for one dimension (usually time). K-d tree Bounding volume hierarchy Spatial...

with dynamic number of processes. In 2008, Almeida et al. introduced Interval Tree Clocks. This mechanism generalizes Vector Clocks and allows operation...

octree Z-order UB-tree R-tree R+ tree R* tree Hilbert R-tree X-tree Metric tree Cover tree M-tree VP-tree BK-tree Bounding interval hierarchy Bounding...

the lcp-interval associated with the corresponding node of suffix tree of S can be defined as: Interval [i,..j], 0 ≤ i ≤ j ≤ n is an lcp-interval of lcp-value...

In mathematics, a real interval is the set of all real numbers lying between two fixed endpoints with no "gaps". Each endpoint is either a real number...

algorithm Java library implementing Allen's Interval Algebra (incl. data and index structures, e.g., interval tree) OWL-Time Time Ontology in OWL an OWL-2...

scalability problems in some settings, but can be replaced by Interval Tree Clocks. Interval Tree Clocks generalize version vectors and vector clocks and allows...

interval. Permuting the vertices on each level of the Stern–Brocot tree by a bit-reversal permutation produces a different tree, the Calkin–Wilf tree...

range query on a range tree reports the set of points that lie inside a given interval. To report the points that lie in the interval [x1, x2], we start by...

Heng; Rong, Jiazhen (9 June 2021). "Bedtk: finding interval overlap with implicit interval tree". Bioinformatics. 37 (9): 1315–1316. doi:10.1093/bioinformatics/btaa827...

generalization of the interval graphs. The connected triangle-free interval graphs are exactly the caterpillar trees. Proper interval graphs are interval graphs that...

nested set collections (also known as trees or hierarchies) in relational databases. It is based on Nested Intervals, that "are immune to hierarchy reorganization...

value "25" into this 2–3–4 tree: Begin at the root (10, 20) and descend towards the rightmost child (22, 24, 29). (Its interval (20, ∞) contains 25.) Node...

consecutive ones property, recognizing interval graphs, and determining whether a graph is planar. If all the leaves of a PQ tree are connected directly to a root...

their own intervals, which recursively aggregate the intervals contained in their own child internal nodes. Eventually, the root of a B+ Tree represents...

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position...

bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees. Bounding interval hierarchies...

Segment tree Interval tree - A degenerate R-tree for one dimension (usually time) Bounding volume hierarchy Spatial index GiST Cover tree Ciaccia, Paolo;...

Left-leaning red–black tree AVL tree B-tree (2–3 tree, 2–3–4 tree, B+ tree, B*-tree, UB-tree) Scapegoat tree Splay tree T-tree WAVL tree GNU libavl Cormen...

{R} } -tree obtained in the following way is nonsimplicial. Start with the interval [0, 2] and glue, for each positive integer n, an interval of length...

(data structure) diet (see discrete interval encoding tree below) difference (set theory) digital search tree digital tree digraph Dijkstra's algorithm diminishing...

perhaps in the interval between songs a rich, sourceless voice coming out of the high darkness where the ragged shadow of the heaven-tree which snooded...

The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to...

Interval recognition, the ability to name and reproduce musical intervals, is an important part of ear training, music transcription, musical intonation...

were pruned at intervals of two to six years so their leafy material would be most abundant. Wood pollards were pruned at longer intervals of eight to fifteen...

independent random real numbers in the unit interval, and by maintaining the Cartesian tree structure using tree rotations after any insertion or deletion...

random-access sequences, described below, ordered sequences, and interval trees. Finger trees can provide amortized O(1) pushing, reversing, popping, O(log...