Re: Future of EDS -- btree?
On 23 Jan 2004, at 2:04, Andy Serpa wrote:
>
>
> Regarding this database talk, has anyone attempted to write a btree
> database implementation in pure Euphoria? One thing that prevents use
> of EDS for really big databases (even if simple in structure -- one
> giant table, for instance) is that it doesn't scale well after a point
> (especially when adding new records, plus all of the keys are kept in
> memory, which can be a problem if there are a gazillion of them). A
> btree structure would potentially remain fairly speedy with millions of
> records (the whole point of btree is too remain fast by minimizing disk
> access), and it is not terribly difficult to implement (I've played
> around with an in-memory version just to get an idea of how to code it
> in Euphoria, but I never got around to making a disk-based version). Am
> I mistaken?
Jiri and others have written "associated lists" that do that, in various ways.
Bach has "hash tables".
Kat
|
Not Categorized, Please Help
|
|
