Another option is to use a Java HashMap (like a struct) instead if you know you that you'll always need to "search" by the struct key.
Alan Holden said the following on 06/16/2009 01:25 PM: > At 255 bytes per record... what, about 2.5 megs? Damn this insanely > complicated math!! > It seems do-able, although I've never done it. > I'll bet a proof of concept with some dummy data would be relatively > simple to whip up. > I'd love to know how it goes - and how long a lookup takes in comparison > to JDBC. > > And your modify and delete methods. It seems like you'd want to just do > a querySetCell to mark a login as "deleted", rather than to literally > remove it. I can picture time spent (shifting rows upward) in doing the > later. > > Alan K. Holden > > > > > > --~--~---------~--~----~------------~-------~--~----~ Open BlueDragon Public Mailing List http://groups.google.com/group/openbd?hl=en official site @ http://www.openbluedragon.org/ !! save a network - trim replies before posting !! -~----------~----~----~----~------~----~------~--~---
