1288
правок
Multidimensional search tree: различия между версиями
Перейти к навигации
Перейти к поиску
Multidimensional search tree (посмотреть исходный код)
Версия от 09:28, 30 ноября 2024
, 30 ноября 2024нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Multidimensional search tree''' --- многомерное дерево сортировки. ''' Multidimensional search trees''' (or '''<math>K-d</math>trees'…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Multidimensional search tree''' --- многомерное дерево сортировки. | '''Multidimensional search tree''' --- ''[[многомерное дерево сортировки]]''. | ||
''' Multidimensional search trees''' (or '''<math>K-d</math>trees''') are a generalization of the well known | ''' Multidimensional search trees''' (or '''[[K-d-Trees|<math>K-d</math> trees]]''') are a generalization of the well known | ||
'' binary search trees'', that handles records with keys of <math>K</math> | '' [[Binary search tree|binary search trees]]'', that handles records with keys of <math>K</math> | ||
attributes. In what follows and without loss of generality, we | attributes. In what follows and without loss of generality, we | ||
identify a record with its corresponding key as <math>x = (x^{(1)}, | identify a record with its corresponding key as <math>x = (x^{(1)}, | ||
| Строка 8: | Строка 8: | ||
refers to the value of the <math>i</math>-th attribute of the key <math>x</math>. | refers to the value of the <math>i</math>-th attribute of the key <math>x</math>. | ||
A ''' multidimensional search tree''' for a set of keys is a '' binary tree'' in which: | A ''' multidimensional search tree''' for a set of keys is a '' [[binary tree]]'' in which: | ||
1. Each node contains a <math>K</math>-dimensional key and has an associated | 1. Each node contains a <math>K</math>-dimensional key and has an associated | ||
| Строка 21: | Строка 21: | ||
Note that, if <math>K = 1</math>, then ''' multidimensional search tree''' is a binary search tree. | Note that, if <math>K = 1</math>, then ''' multidimensional search tree''' is a binary search tree. | ||
<nowiki>[[Категория:Деревья]]</nowiki> | |||
<nowiki>[[Категория:Информационные деревья]]</nowiki> | |||
<nowiki>[[Категория: English terms (английские термины)]]</nowiki> | |||