• Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

criteriaFind implementation

 
Ranga Vure
Greenhorn
Posts: 2
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi All ,

I want to start the assignment with implementing search criteria. Iam planning to read all records once and build binary tree . Tree contains the nodes of origin , dest , carrier and finally the record no and data . If any new rec or modified then add to the tree . Is this better approach to read all rec once just to know what are the records containg the search criteria .
Thanks
Ranga
[ September 07, 2002: Message edited by: Ranga ]
 
Manish Kumar
Ranch Hand
Posts: 53
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi Ranga,
I don't think that holding all records in memory is a good idea.. It would be ok if you have only 24 records (for this assignment) but what if the database size is too big??
regards
-Manish
-------
SCJP2
 
Ranga Vure
Greenhorn
Posts: 2
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Well , i agree . I am struggling between memory VS speed . My intention is to build a Index kind of feature, thus avoiding reading all records during the search . can you guide me with some other alternatives to implement this , iam stuck with this .

Thanks
Ranga
 
Valentin Crettaz
Gold Digger
Sheriff
Posts: 7610
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Ranga,
Welcome to Javaranch
We'd like you to read the Javaranch Naming Policy and change your publicly displayed name (change it here) to comply with our unique rule. Thank you.
PS: Quote from the naming policy:

For your publicly displayed name, use a first name, a space, and a last name. Obviously fictitious names or improperly formatted names may be locked out.
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic