Re: Q: performance comparison SE <-> dBase

In article <3vm6nu$76u@news.onramp.net>, mshackel@mailhost.onramp.net says... own stuff deleted... >dBase uses the keyed name to set the btree index position, whereas SQL >queries return solution sets. This is a low-level index operation vs. a >high level relational query. I don't think Novell vs Unix or dBase vs SQL >is the proper question, the question is what are you forcing your chosen >platform to do? ... >While the instant-update-as-typed feature is neat and very interactive, I >can't think of a way to do the equivalent operation efficiently using >SQL. > You express very clearly what I guessed as much. Do you know if such a low-level index operation could be programmed in a C-function, which could be linked to the runner? It would be a great supplement to SQL, I think. Anyone else have some ideas about this? I can't stand dBase-apps getting the better of me :-) Piet Brekelmans