Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
fast functional in-memory database?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Alexy Khrabrov <deliverable@g...>
Subject: fast functional in-memory database?
I've looked at APL descendants like J ( and Q (,  
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+...