|
On 12/14/05, Rich Duzenbury <rduz-midrange@xxxxxxxxxxxxxxxxxxx> wrote: > > Then READE should operate via the same mechanism then, and have similar > response time. If it does not, it is at best, an implementation > deficiency. > I agree here. I have always thought that it could work like this: - You have a file you are reading in keyed order, and if you perform a READE - The system reads a block of records, in keyed order into the buffer. - If you issue another READE with the same key, the buffer is searched FIRST for a matching key, before going out to disk again But instead, we are forced to code the key-change detection ourselves, and use READ. Thankfully, it isn't difficult. -- "Enter any 11-digit prime number to continue..." "In Hebrew SQL, how do you use right() and left()?..." - Random Thought "If all you have is a hammer, all your problems begin to look like nails"
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
