B*-trees

Hi,

i think about implementing my own B*-tree and a database which supports multiple indices.

I have a few questions about it.

1. It's a good idea to separate the B-tree with the indices and the data of the table entries in different files, isn't it? It should give you the possibility to put both files on different hard drives and therefore speed up things... and it's easier to reorganize the b-tree without touching the data file.
2. Are there any advantages when i save the different B-Trees to different files, too (i.e. one b-tree per file?)
3. Is there a kind of "Tiny-SQL"-standard which offers a very reduced instruction set or do i have to define my own query language?

Thanks
Chris Received on Wed Jan 10 2001 - 19:24:44 CET