Comments on: Obviously there’s something wrong with the way I’m profiling perl scripts http://blog.xcski.com/2005/06/19/obviously-theres-something-wrong-with-the-way-im-profiling-perl-scripts Everything I used to bore people on newsgroups and mailing lists with, now in one inconvenient place. Sat, 19 Jul 2008 17:42:57 +0000 http://wordpress.org/?v=2.6 By: Paul Tomblin http://blog.xcski.com/2005/06/19/obviously-theres-something-wrong-with-the-way-im-profiling-perl-scripts#comment-1026 Paul Tomblin Sun, 26 Jun 2005 22:24:55 +0000 http://xcski.com/blogs/pt/2005/06/19/obviously-theres-something-wrong-with-the-way-im-profiling-perl-scripts#comment-1026 Richard, I've thought about something like that, but I like the flexibility of the relational model. For instance, I have a separate table for runway data, and another one for communications frequencies. I'm currently looking at using BerkeleyDB to handle the intermediate storage of the array, instead of slurping it all into memory. Richard, I’ve thought about something like that, but I like the flexibility of the relational model. For instance, I have a separate table for runway data, and another one for communications frequencies.

I’m currently looking at using BerkeleyDB to handle the intermediate storage of the array, instead of slurping it all into memory.

]]> By: Richard Letts http://blog.xcski.com/2005/06/19/obviously-theres-something-wrong-with-the-way-im-profiling-perl-scripts#comment-1025 Richard Letts Sun, 26 Jun 2005 20:32:06 +0000 http://xcski.com/blogs/pt/2005/06/19/obviously-theres-something-wrong-with-the-way-im-profiling-perl-scripts#comment-1025 I've been thinking about this problem. I'm not sure that Perl and/or SQL is the right choice for the problem you're trying to solve in a constrained memory environment. In C some 15,000 nodes would only require some 45K of storage (plus some overhead), at the expense of reading all records once, and selected records a second time on output. If you need records sorted then sort-on-insert would be efficient. Is there a way you could break the problem into two, and use Perl for the display/control, and use C (or java, or other language) for the data-retrieval? I’ve been thinking about this problem. I’m not sure that Perl and/or SQL is the right choice for the problem you’re trying to solve in a constrained memory environment. In C some 15,000 nodes would only require some 45K of storage (plus some overhead), at the expense of reading all records once, and selected records a second time on output. If you need records sorted then sort-on-insert would be efficient. Is there a way you could break the problem into two, and use Perl for the display/control, and use C (or java, or other language) for the data-retrieval?

]]>