I think I will use the "Range Search" example at the book "the algorithm design manual" by Steven S Skiena
But I need help with the traversal problem. Yes, the data will be modified a lot and will be searched a lot, do you have a example of that kind of problem? Thanks a lot guys! Em quarta-feira, 18 de abril de 2012 18h19min46s UTC-3, Gil LB escreveu: > > Thank you for all advices, I will research about all you say and come back > with my thoughts. > > Em quarta-feira, 18 de abril de 2012 16h31min14s UTC-3, Gil LB escreveu: >> >> Hello everybody, first, I am sorry about english mistakes, I am brasilian >> =) >> >> I have an application that have a huge data, but a small part of it is >> always accessed all the time by all the users. >> >> I am thinking about having a cache in the application state, on an >> matrix, but I am looking for some advice of you. >> The data should be ordered by X and Y coordinates, and will be iterated >> everytime some user want to know which data is near of him by the >> coordinates. >> >> Example: >> >> var data = [ >> 31: [ >> 56: "entry1", >> 58: "entry2", >> 78: "entry3" >> ] >> 34: [ >> 2: "entry4" >> ] >> ]; >> //it will be a lot larger than that >> >> //and the user will call something like: >> findAllEntriesNear(32, 30); >> >> It is a good idea store in an Matrix like that? >> >> Thank you everybody =) >> >> Gil Lopes Bueno >> > -- Job Board: http://jobs.nodejs.org/ Posting guidelines: https://github.com/joyent/node/wiki/Mailing-List-Posting-Guidelines You received this message because you are subscribed to the Google Groups "nodejs" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/nodejs?hl=en?hl=en
