a_bertrand Posted January 3, 2011 Share Posted January 3, 2011 As I'm developping a little toy of mine, mainly for the fun, and during that development I had to face an odd situation where MySQL myIsam nor InnoDB would be fast enough. Yes it's odd but it happens. And yet the situation can be solved by storing things manually without the help of any DB. Yet this storage do require a quick retrieval and within a HUGE number of records. I'm willing to share my solution (pseudo code or C# based) with the community if there is a little interest about it. The basic idea here is VERY quick data storage, then index creation and then the data will be not touched basically and therefore only query from that time on. Who would be interested in such info? Quote Link to comment Share on other sites More sharing options...
Dominion Posted January 3, 2011 Share Posted January 3, 2011 Well I am interested in seeing how you have done it, and if it could be adapted to work better then what I am currently using. As it stands I have inserts into text files showing set actions etc... If you're willing to post it I would be interested. Quote Link to comment Share on other sites More sharing options...
Danny696 Posted January 3, 2011 Share Posted January 3, 2011 I too am intrested in seeing how youve done this. Quote Link to comment Share on other sites More sharing options...
Nickson Posted January 3, 2011 Share Posted January 3, 2011 same Quote Link to comment Share on other sites More sharing options...
Spudinski Posted January 3, 2011 Share Posted January 3, 2011 The fastest way I can think of, is by storing it in memory. But it wouldn't quite fit. And a flat-file database would be too slow. I'd also be interested, or in actual, I'm just curios. Quote Link to comment Share on other sites More sharing options...
a_bertrand Posted January 4, 2011 Author Share Posted January 4, 2011 Here is my info, if you need more details then ask and I will try to answer: http://makewebgames.io/board721/34508-store-and-retreive-data-when-mysql-is-too-slow BTW spudinski, memory is certainly quick but will fail when your data set is larger than your available memory plus it will be dropped as soon as your process quit or your computer restart / switch off. Also, binary trees in memories are not complex at all to build and offer the same advantage as the one I presented: log2(n) access time instead of n for simple lists (where "n" is the number of records and this returns the worse case scenario). Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.