At 01:33 AM 1/29/2002 -0500, you wrote: >What kind of performance are you getting from JISP? > >For JCS I tried using a generic key that would take a serialized object >and compared on the hashcode and the performance is not so great. I ran >jprobe on it and the io is the bottleneck. The hashcode was >insignificant. . . . Maybe I'm too tired to see the problem. I don't tried JISP, I think there are a lot of BTree implementations, and user can choose one, may be JISP or his implementation. I know NetBeans have some implementation may be it is the same JISP, I saw JDO RI use it. Berkeley DB is very powerful for this kind of storage http://sleepycat.com , and believe there are more implementations . But we don't have open source stress tools, I think this is the main problem, I have no budget for simplestore to buy jprobe and its sources.
>How much memory is it using for the keys and index? > >Keys are pretty cheap. If you can keep them in memory and store the >values on disk, you can get a tremendous performance boost. I did this >for one of the disk cache auxiliaries in JCS. . . . Yes, it is good idea to have index in memory for BTree implementation >Hmmn. > >Aaron > > > > >-- >To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> >For additional commands, e-mail: <mailto:[EMAIL PROTECTED]> -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
