733:
138:(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.
122:(1990) because it emphasizes prevention of overlap in the bounding boxes, which increasingly becomes a problem in high dimensions. In cases where nodes cannot be split without preventing overlap, the node split will be deferred, resulting in
807:
134:
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
778:
470:
677:
155:
802:
221:
165:
126:. In extreme cases, the tree will linearize, which defends against worst-case behaviors observed in some other data structures.
337:
771:
19:
This article is about a tree data structure for storing data in multiple dimensions. For the XTree file manager, see
302:
135:
687:
243:
764:
34:
214:
381:
230:
95:
371:
326:
485:
261:
341:
652:
611:
437:
427:
306:
182:
546:
247:
207:
161:
748:
637:
82:
186:
797:
581:
331:
56:
154:
Selçuk Candan, K.; Luisa Sapino, Maria (31 May 2010). Cambridge
University Press (ed.).
744:
534:
529:
412:
346:
60:
791:
682:
662:
505:
394:
321:
256:
642:
606:
422:
417:
399:
311:
692:
657:
647:
561:
495:
490:
480:
389:
238:
110:
used for storing data in many dimensions. It appeared in 1996, and differs from
702:
672:
632:
475:
404:
351:
271:
740:
707:
667:
514:
442:
432:
596:
286:
115:
712:
586:
566:
539:
524:
276:
732:
697:
601:
576:
519:
366:
296:
291:
266:
199:
119:
591:
571:
556:
465:
356:
281:
111:
107:
460:
361:
316:
20:
452:
203:
187:"The X-tree: An Index Structure for High-Dimensional Data"
752:
625:
504:
451:
380:
237:
81:
66:
55:
43:
33:
28:
772:
215:
8:
779:
765:
222:
208:
200:
106:) is an index tree structure based on the
52:
157:Data Management for Multimedia Retrieval
16:Index tree structure in computer science
191:Proceedings of the 22nd VLDB Conference
146:
25:
7:
808:Algorithms and data structures stubs
729:
727:
181:Berchtold, Stefan; Keim, Daniel A.;
751:. You can help Knowledge (XXG) by
14:
731:
1:
136:minimum bounding rectangles
824:
726:
18:
803:Database index techniques
51:
678:Left-child right-sibling
508:data partitioning trees
466:C-trie (compressed ADT)
193:. Mumbai, India: 28–39.
747:-related article is a
688:Log-structured merge
231:Tree data structures
96:tree data structures
94:In computer science
183:Kriegel, Hans-Peter
653:Fractal tree index
248:associative arrays
104:eXtended node tree
760:
759:
721:
720:
92:
91:
88:
87:
815:
781:
774:
767:
735:
728:
224:
217:
210:
201:
195:
194:
178:
172:
171:
151:
83:Space complexity
53:
26:
823:
822:
818:
817:
816:
814:
813:
812:
788:
787:
786:
785:
745:data structures
724:
722:
717:
621:
500:
447:
376:
372:Weight-balanced
327:Order statistic
241:
233:
228:
198:
180:
179:
175:
168:
153:
152:
148:
144:
132:
57:Time complexity
24:
17:
12:
11:
5:
821:
819:
811:
810:
805:
800:
790:
789:
784:
783:
776:
769:
761:
758:
757:
736:
719:
718:
716:
715:
710:
705:
700:
695:
690:
685:
680:
675:
670:
665:
660:
655:
650:
645:
640:
635:
629:
627:
623:
622:
620:
619:
614:
609:
604:
599:
594:
589:
584:
579:
574:
569:
564:
559:
554:
537:
532:
527:
522:
517:
511:
509:
502:
501:
499:
498:
493:
488:
486:Ternary search
483:
478:
473:
468:
463:
457:
455:
449:
448:
446:
445:
440:
435:
430:
425:
420:
415:
410:
402:
397:
392:
386:
384:
378:
377:
375:
374:
369:
364:
359:
354:
349:
344:
334:
329:
324:
319:
314:
309:
299:
294:
289:
284:
279:
274:
269:
264:
259:
253:
251:
235:
234:
229:
227:
226:
219:
212:
204:
197:
196:
173:
166:
145:
143:
140:
131:
128:
90:
89:
86:
85:
79:
78:
73:
68:
64:
63:
61:big O notation
49:
48:
45:
41:
40:
37:
31:
30:
15:
13:
10:
9:
6:
4:
3:
2:
820:
809:
806:
804:
801:
799:
796:
795:
793:
782:
777:
775:
770:
768:
763:
762:
756:
754:
750:
746:
742:
737:
734:
730:
725:
714:
711:
709:
706:
704:
701:
699:
696:
694:
691:
689:
686:
684:
681:
679:
676:
674:
671:
669:
666:
664:
663:Hash calendar
661:
659:
656:
654:
651:
649:
646:
644:
641:
639:
636:
634:
631:
630:
628:
624:
618:
615:
613:
610:
608:
605:
603:
600:
598:
595:
593:
590:
588:
585:
583:
580:
578:
575:
573:
570:
568:
565:
563:
560:
558:
555:
552:
550:
544:
542:
538:
536:
533:
531:
528:
526:
523:
521:
518:
516:
513:
512:
510:
507:
503:
497:
494:
492:
489:
487:
484:
482:
479:
477:
474:
472:
469:
467:
464:
462:
459:
458:
456:
454:
450:
444:
441:
439:
438:van Emde Boas
436:
434:
431:
429:
428:Skew binomial
426:
424:
421:
419:
416:
414:
411:
409:
407:
403:
401:
398:
396:
393:
391:
388:
387:
385:
383:
379:
373:
370:
368:
365:
363:
360:
358:
355:
353:
350:
348:
345:
343:
339:
335:
333:
330:
328:
325:
323:
320:
318:
315:
313:
310:
308:
307:Binary search
304:
300:
298:
295:
293:
290:
288:
285:
283:
280:
278:
275:
273:
270:
268:
265:
263:
260:
258:
255:
254:
252:
249:
245:
240:
236:
232:
225:
220:
218:
213:
211:
206:
205:
202:
192:
188:
184:
177:
174:
169:
167:9781139489584
163:
159:
158:
150:
147:
141:
139:
137:
129:
127:
125:
121:
117:
113:
109:
105:
101:
97:
84:
80:
77:
74:
72:
69:
65:
62:
58:
54:
50:
46:
42:
38:
36:
32:
27:
22:
753:expanding it
738:
723:
616:
548:
540:
405:
338:Left-leaning
244:dynamic sets
239:Search trees
190:
176:
156:
149:
133:
123:
103:
99:
93:
75:
70:
638:Exponential
626:Other trees
124:super-nodes
118:(1987) and
792:Categories
741:algorithms
582:Priority R
332:Palindrome
142:References
76:Worst case
668:iDistance
547:implicit
535:Hilbert R
530:Cartesian
413:Fibonacci
347:Scapegoat
342:Red–black
130:Structure
67:Operation
683:Link/cut
395:Binomial
322:Interval
185:(1996).
120:R*-trees
116:R+-trees
114:(1984),
44:Invented
643:Fenwick
607:Segment
506:Spatial
423:Pairing
418:Leftist
340:)
312:Dancing
305:)
303:Optimal
112:R-trees
71:Average
798:R-tree
693:Merkle
658:Fusion
648:Finger
572:Octree
562:Metric
496:Y-fast
491:X-fast
481:Suffix
400:Brodal
390:Binary
164:
108:R-tree
100:X-tree
29:X-tree
739:This
703:Range
673:K-ary
633:Cover
476:Radix
461:Ctrie
453:Tries
382:Heaps
362:Treap
352:Splay
317:HTree
272:(a,b)
262:2–3–4
102:(for
98:, an
21:XTree
749:stub
708:SPQR
587:Quad
515:Ball
471:Hash
443:Weak
433:Skew
408:-ary
162:ISBN
47:1996
39:Tree
35:Type
743:or
713:Top
567:MVP
525:BSP
277:AVL
257:2–3
59:in
794::
698:PQ
612:VP
602:R*
597:R+
577:PH
551:-d
543:-d
520:BK
367:UB
292:B*
287:B+
267:AA
189:.
160:.
780:e
773:t
766:v
755:.
617:X
592:R
557:M
553:)
549:k
545:(
541:k
406:d
357:T
336:(
301:(
297:B
282:B
250:)
246:/
242:(
223:e
216:t
209:v
170:.
23:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.