* fast functional in-memory database?
@ 2008-12-15 8:33 Alexy Khrabrov
0 siblings, 0 replies; only message in thread
From: Alexy Khrabrov @ 2008-12-15 8:33 UTC (permalink / raw)
To: caml-list
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2008-12-15 8:33 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2008-12-15 8:33 fast functional in-memory database? Alexy Khrabrov
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).