There is probably no point in trying to make Muq a serious competitor to Oracle, DB2, or even MySql: bridge programs interfacing to them make more sense than re-inventing them, when such functionality is seriously needed.
But Codd's relational db algebra is very pretty and useful, and a basic implementation could be done in an evening or two: Muq already provides persistent storage, automatic storage allocation, management and reclamation, and B-tree indices (via the Index class) so all you really need to do is to write a few short functions implementing the various canonical operations, and then a simple compiler for the syntax.
The result could be a good code example for novice programmers to play with, and could also be downright useful for quick-and-dirty hacking around with small datasets when cranking up a major league external database program just isn't worth the effort.
I have a feeling this particular one will never rise to the top of my personal programming project queue, so it will probably have to wait for someone else to get interested.
Go to the first, previous, next, last section, table of contents.