B-Trees, B+Trees, skiplists, ISAM-files
Hello everybody,
I want to build a database in Euphoria. I looked at the Euphoria
database demo code and its usefull for small databases. For the
somewhat bigger databases I need faster access with indexfiles. I
think in terms of B+Trees, skiplist, hash tables or stuff like that.
I studied some B-Tree/ISAM in C and Pascal but to understand how its
works and to convert it into Euphoria code are two different things.
Therefore I'm looking for participants to create some new code or to
translate some existing C or Pascal code to Euphoria. Maybe, RDS can
provide Euphoria with index data objects in the way they did with
ATOMS and SEQUENCES or maybe you have a better Idea. Let me know.
Greetings,
Marcel Kollenaar
|
Not Categorized, Please Help
|
|
