Date sent: Tue, 11 Dec 2007 18:16:12 -0500 From: Christopher Schultz <[EMAIL PROTECTED]> Subject: Re: Help with java Lists To: Tomcat Users List <users@tomcat.apache.org> Send reply to: Tomcat Users List <users@tomcat.apache.org>
> -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Steve, > > Steve Ochani wrote: > > Keeping less data in each node should make searching the list fast. > > Huh? I'm pretty sure that pointer dereferencing performance does not > depend on memory size (ignoring memory paging, of course). > Yes correct but as I understood the OP he was searching the CONTENTS/DATA of each node. If for ex. you have 100 nodes each having 10MB of data, searching through this list will be slower than searching through a list of lets say 100 nodes with each node only having 1 MB of data. -Steve O. --------------------------------------------------------------------- To start a new topic, e-mail: users@tomcat.apache.org To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
