Phil Endecott wrote:
But in order to be useful, such a library would need to offer all of the important features of current databases, i.e. good performance with huge on-disk data sets, transactions, client/server operation, concurrency, and so on. To some extent these requirements can be usefully addressed as individual problems.
So if someone is looking for something to do, how about starting with containers, iterators and allocators for huge on-disk data structures. This could be based on the existing shared memory containers, but using mmap()ed windows into files. Then we'd probably want some sort of dynamic algorithm selection ("query planning") mechanism.
Aren't you designing a database here instead of a generic relational interface? Sebastian Redl