i think that topic is larger than the presentation thus far. hopefully memory mapped flash will obviate the need for alot of this but: o you need to make an

i think that topic is larger than the presentation thus far. hopefully memory mapped flash will obviate the need for alot of this but: o you need to make an on-disk structure (i.e. btree) to let you search your tables (indices) o that has to be fronted by an in memory cache o your on-disk structure should maintain consistency even if the power fails and some writes get lost - often but not always this is facilitated by keeping a separate write-optimized structure called a write-ahead-log - if you use a WAL, you'll also need to implement the replay mechanisms to get the primary indices back up to date on a failure o because the disk operations are expensive and high latency you'll need to start managing concurrency explicitly back ends are alot of work. unfortunately this is a place where the lack of decent concurrency mechanisms in your language and OS interface can really cause alot of headache. pedagogically, i guess you would start with a completely synchronous non fault tolerant btree? or a maybe just the log, and introduce trees as a read accelerator?