Posted by Steve Auerbach on December 11, 2009 at 06:49:39:
In Reply to: Re: Announcing the MySql device for IB programs posted by Justin Guerber on December 10, 2009 at 12:04:27:
Here I am sticking my neck in where I'm not qualified, BUT Grant, and others, are really looking for a faster search. We don't really care about how it's done except we'd like it to be easy to implement. Think Barbara's CmtHelpD.
Being very very old I remember when the Report Generator [you remember the Report Generator?] was so very much faster than Qicbasic programs.
I wondered why and ultimately, somehow, I learned that it did not read records, it read sectors. So it bypassed the key tree and when there were two or three or more records per 756 byte sector (oh for when men where men and discs were tiny and expensive0 the number of disk accesses dropped dramatically. Of course, that trick only came into play when the Search statement came before Report and when there was a Sort following because the results were returned in temporal order -- as the data was stored in the data portion of the file.
How about a little back-to-the-future? Can we have something like that today??
Each file can be a maximum of 1MB in length Uploaded files will be purged from the server on a regular basis.