<s>
Distributed	B-Algorithm
tree	I-Algorithm
search	I-Algorithm
(	O
DTS	O
)	O
algorithm	O
is	O
a	O
class	O
of	O
algorithms	O
for	O
searching	O
values	O
in	O
an	O
efficient	O
and	O
distributed	O
manner	O
.	O
</s>
<s>
The	O
Distributed	B-Algorithm
Tree	I-Algorithm
Search	I-Algorithm
Algorithm	O
(	O
also	O
known	O
as	O
Korf	O
–	O
Ferguson	O
algorithm	O
)	O
was	O
created	O
to	O
solve	O
the	O
following	O
problem	O
:	O
"	O
Given	O
a	O
tree	O
with	O
non-uniform	O
branching	O
factor	O
and	O
depth	O
,	O
search	O
it	O
in	O
parallel	O
with	O
an	O
arbitrary	O
number	O
of	O
processors	O
as	O
fast	O
as	O
possible.	O
"	O
</s>
<s>
The	O
Internet	O
can	O
be	O
seen	O
as	O
a	O
tree	O
of	O
IP	B-Protocol
addresses	I-Protocol
,	O
and	O
an	O
analogy	O
to	O
a	O
routing	O
protocol	O
could	O
be	O
how	O
post	O
offices	O
work	O
in	O
the	O
real	O
world	O
.	O
</s>
<s>
Since	O
there	O
are	O
over	O
4.3	O
billion	O
IP	B-Protocol
addresses	I-Protocol
currently	O
,	O
society	O
heavily	O
depends	O
on	O
the	O
time	O
the	O
data	O
takes	O
to	O
find	O
its	O
way	O
to	O
its	O
destination	O
.	O
</s>
<s>
This	O
could	O
be	O
achieved	O
through	O
the	O
plain	O
use	O
of	O
DTS	O
,	O
but	O
other	O
algorithms	O
are	O
used	O
in	O
place	O
(	O
for	O
example	O
data-hashing	O
in	O
SQL	B-Language
databases	I-Language
)	O
,	O
or	O
in	O
conjunction	O
(	O
Facebook	O
's	O
Haystack	O
algorithm	O
groups	O
parallel	O
tree-search	O
,	O
data-hashing	O
and	O
memory-ordering/sorting	O
)	O
.	O
</s>
<s>
The	O
most	O
important	O
challenge	O
to	O
this	O
algorithmic	O
concept	O
was	O
an	O
article	O
by	O
Kröll	O
B	O
,	O
«	O
Balanced	O
Distributed	O
Search	B-Data_Structure
Trees	I-Data_Structure
Do	O
Not	O
Exist	O
»	O
,	O
which	O
does	O
not	O
attack	O
the	O
veracity	O
or	O
current	O
efficiency	O
of	O
the	O
algorithm	O
,	O
but	O
rather	O
the	O
fact	O
that	O
DTS	O
itself	O
,	O
no	O
matter	O
how	O
many	O
improvements	O
are	O
made	O
to	O
it	O
(	O
for	O
example	O
balancing	O
the	O
input	O
tree	O
before-hand	O
)	O
,	O
will	O
never	O
be	O
able	O
to	O
reach	O
optimal	O
resolution-time	O
.	O
</s>
