Hi, monks!
I'm generating student accounts at a community college. I read in daily flat-file enrolment and fee data and then adjust accounts accordingly. Unfortunatly, this is only instant-in-time data and it doesn't help me very much for complicated situations, like name changes and missed-a-day problems and whatnot. So, I'm writing a new system that contains history as well as the right-now data. This means I'm going to have a lot more data and I'm going to search it in a lot more ways. I have a prototype that I wrote several years ago, and it's durn slow and I'd like this one to be faster. I figure I could use a database or maybe just dbm files, or maybe a flat file really is fine, but I had other problems. So, I want to compare some different ways of storing and retrieving this stuff.
My problem is, I can't think of a way to test and benchmark without writing a complete app in each case. I'd like to benchmark with a test rig of some kind, but I don't know how to make a test rig that would be accurate without just building the whole app.
Any advice?
Thanks!
--Pileofrogs
In reply to Benchmarking Strategy? by pileofrogs
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |