I've looked at APL descendants like J (jsoftware.com) and Q (kx.com),
and found Q very interesting due to its underlying in-memory database,
kdb+. It made me think of a way to experiment with it in OCaml. The
idea is that once you marry vector/list processing with very fast SQL-
like in-memory database, you get a fast and elegant formalism to
transform the data. Is there anything which can be plugged into OCaml
to play the role of the database? I guess even SQLite can be used
with in-memory tables, or better yet PG'OCaml, yet it's the tight
integration seems the main strength of kdb+...
Cheers,
Alexy
_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
