X-tree

<h2 id="structure">Structure</h2>
<p>The X-tree consists of three different types of nodes—data nodes, normal directory nodes and supernodes. The data nodes of the X-tree contain rectilinear <a href="/facts/Minimum_bounding_rectangle/yfDEoK8d">minimum bounding rectangles</a> (MBRs) together with pointers to the actual data objects, and the directory nodes contain MBRs together with pointers to sub-MBRs. Supernodes are large directory nodes of variable size(a multiple of the usual block size). The basic goal of supernodes is to avoid splits in the directory that would result in an inefficient directory structure.
</p>

Wikimedia Commons has media related to X-trees.

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Selçuk Candan, K.; Luisa Sapino, Maria (31 May 2010). Cambridge University Press (ed.). Data Management for Multimedia Retrieval. Cambridge University Press. ISBN 9781139489584. <a href="9781139489584" target="_blank">9781139489584</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Berchtold, Stefan; Keim, Daniel A.; Kriegel, Hans-Peter (1996). "The X-tree: An Index Structure for High-Dimensional Data". Proceedings of the 22nd VLDB Conference. Mumbai, India: 28–39. <a href="/wiki/Hans-Peter_Kriegel" target="_blank">/wiki/Hans-Peter_Kriegel</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

X-tree open-in-new

X-tree