how hunt twine formed key/value collection fast


hello associate smoke-stack ers!



i have list 200.000 twine entries, normal twine length around 30 characters. list difference pivotal any pivotal i have domain object. i domain objects collection wholly meaningful biased key. i.e. hunt twine "kov" instance review pivotal "stack ".



currently i am controlling ternary hunt tree (tst), wholly equipment within 100 milliseconds. however too delayed requirements. tst doing softened teenager optimizations i try change tree. nonetheless i figured things give me 5x - 10x speed alleviation i am aiming at. i am presumption reason being delayed i fundamentally have revisit many nodes tree.



any ideas provoke speed algorithm? there any algorithms i should looking at?



thanks advance,
oskar



Comments

Popular posts from this blog

list macos calm editors formula editors

how hibernate @any-related annotations?

why does floated <input> control floated component slip over too distant right ie7, nonetheless firefox?