I'm generally deficient when it comes to databases but curious how one
creates a memory based one. Is there a trick, and does it work with others
besides sql?
This is probably a newbie question.
--
Jacqueline Landman Gay | jac...@hyperactivesw.com
HyperActive Software | http://www.hyperactivesw.com
On December 31, 2018 11:31:15 AM Bob Sneidar via use-livecode
<use-livecode@lists.runrev.com> wrote:
For multiple recursions into an array I came up with a method for loading
an array into a memory based sql database. Subsequent queries take less
time, depending of course on how complex they are, but you can do lots of
cool thinks, like complex filtering / sorts, calculations, etc. to a
cursor, then I have a function that converts a cursor to an array.
I originally used it to get the topmost, leftmost, bottommost and rightmost
objects on a card that were visible by using min and max queries on a list
of the objects. But of course the method can be expanded to do almost anything.
Bob S
On Dec 30, 2018, at 11:33 , Malte Pfaff-Brill via use-livecode
<use-livecode@lists.runrev.com> wrote:
Not yet fixable for me:
Array operations on larger data sets still slower than they were
Non engine related:
My SQL-Fu has improved a bit ;-) Quite a bit of performance to gain there.
Did anybody of you happen to refactor old code and if so, do you have any
observations you might want to share?
Cheers,
Malte
_______________________________________________
use-livecode mailing list
use-livecode@lists.runrev.com
Please visit this url to subscribe, unsubscribe and manage your
subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
_______________________________________________
use-livecode mailing list
use-livecode@lists.runrev.com
Please visit this url to subscribe, unsubscribe and manage your subscription
preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
