Hi there
I like to know if any class avilable before proceeding on my work.
I need a inverted list behaviour for sequential access of elements for
both direction (previous(),next()) also search element if exist or not
and locate position. Since sequential iteration for search is costly I
like to have access by b-tree behaviour.
Hence I will deal with some large counts of elements (in several K),
memory utilization and search time is my concern.
I'm planning to use sorted arrays as list elements (as clusters)
(enable me b-seacrh in node and reduce node count). planning to
construct a balanced b-tree over these nodes (by include left & right
links).
Any help will be appritiated.