On Aug 23, 2010, at 08:45, Patrick Roehl wrote: > > > 3) The binary search from step 1 indicates where the new entry should be > inserted. To add the entry to the list, individual entries are moved one > at a time (to avoid overlapping moves) to open a spot in the list for the > new entry. > At least, keep the active entries at the top of the storage area and MVCL downward to avoid overlapping moves while avoiding the overhead of one-at-a-time.
Would name/token services work for you? What's its storage overhead? At some large number of entries it will outperform moving the list for each new entry. At some larger number it becomes an abuse of system resources. Hash sounds good. -- gil
