I suppose the "binary paging" approach mentioned in the design considerations
document means the problem of organizing the data efficiently on disk
right from the start. Is this correct?
Do you think it would make good sense to start working on the btree library
without thinking much about on-disk efficiency, leaving this part for later?
I'm not sure a btree where on-disk storage organization is separeted from the
rest like that can achieve enough efficiency...
Thanks,
Leslie
_______________________________________________
elephant-devel site list
elephant-devel@common-lisp.net
http://common-lisp.net/mailman/listinfo/elephant-devel
