data structures - insert into vantage-point tree -
given large collection of 64 bit integers, goal find integer smallest hamming
distance new integer, after new integer inserted in collection. practice, plan on using vantage-point tree
, uses small amount of storage lookup performance provides. however, having problems figuring out how insert
in(and possibly delete from) such tree.
after looking around not sure anymore if datastructure suitible operation, question follows:
is possible insert vantage-point tree without rebuilding whole tree?
if yes, ask time complexity of operation is, , directions on how it.
i have used following references tree:
the paper introduced structure not provide algorithm insertion. sounds should possible, though.
yianilos, peter n. "data structures , algorithms nearest neighbor search in general metric spaces." soda. vol. 93. no. 194. 1993.
one solution use separate, less efficient data structure inserts (and deletes), , when gets large, rebuild tree new data.
Comments
Post a Comment