]> On Nov 18, 2003, at 17:49, Martin Berger wrote: > Brian Hurt wrote: > >> For any large, complex, data structure & algorithm heavy application, >> Ocaml is the best language I know of. > > what i've always wondered about is the following: all the benchmarks > i have seen make ocaml look very good, but they are all using trivial > programs. has anyone hands-on experience with using ocaml for > processing > *large* data-sets? by large i mean at least 1 GB? i am slightly worried > about garbage collection performance in this case. Absolutely. That's what attracted me to ocaml. I wrote the same program in python (original implementation), eiffel, bigloo scheme, ocaml (and probably some others), and C. At the time, my benchmarks suggested bigloo and ocaml were neck-and-neck, just slightly slower than the C version. I was more comfortable with scheme, so I went with it. Turns out, the scheme one wasn't really faster with the large data sets I was running in production. I also had some reliability problems with exceptions. Now, I've got two daily log processing apps (pretty decently large data sets, well over a gig) that finish in about 20 minutes where all others would take multiple hours. Not very useful benchmarks, but for sure, it's faster than anything else I've used for these tasks. I've also ported ocaml and ocamlopt to SunOS 4.1.4 where I use it to process all of my mail daily. That's all the mail I've received since about 1998 and all the mail I've sent since about 1994. -- SPY My girlfriend asked me which one I like better. pub 1024/3CAE01D5 1994/11/03 Dustin Sallings <dustin@spy.net> | Key fingerprint = 87 02 57 08 02 D0 DA D6 C8 0F 3E 65 51 98 D8 BE L_______________________ I hope the answer won't upset her. ____________ ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners