Sarah uttered:
Hi, John Stanton
I really really appreciate your warm help.
That's great if you can send me the codes of B tree and B+ tree.
Many thanks in advance.
My requirements for data access are as follows:
-all the data are stored in non-volatile memory instead of volatile memory
-the footprint of the DARE should be better less than 100KB
-when executing, the memory occupation should be better less than 20KB
-no need for relational access, just key-value retrieval is ok
-all the create, insert, update work can be done outside, however, pretty fast
retrieval is needed
If there is some open-source DARE(as excellent as SQLite) suitable for my
platform, that will be great.
Orelse, I would try to write a simple one.
There is, of course, the BTree code in SQLite itself. It is small and
fast. btree.h is pretty self documenting.
Not to knock John's work, mind:)
Sarah
----- Original Message -----
From: "John Stanton" <[EMAIL PROTECTED]>
To: <sqlite-users@sqlite.org>
Sent: Monday, October 23, 2006 5:54 AM
Subject: Re: [sqlite] any data access and retrieval engine?
Clay Dowling wrote:
Sarah wrote:
Hi,all
First of all, I want to thank all the guys on this mailing list for their warm
help.
After 1 more month of work, I finally make SQLite work on my embedded
environment. SQLite is really great! Many thanks,Drh.
But, due to the extremely heavy hardware constraints, I have to give up SQLite
finally.
So I'm trying to find a much simpler data access and retrieval engine.
Could anyone give me some help on this issue?(some guidance on how to make a
DARE or is there any open-source one available?)
thanks in advance.
The Berkeley DB engine and it's related engines might be suitable for
your situation. They don't give relational access, but they do give
fast key=>value retreival and that might be suitable. The SleepyCat DB
engine from SleepyCat Software is probably the best, but for a
commercial application the licensing fees mean that you have to be well
funded and expect a good return on the product.
Clay Dowling
Berkely DB is still quite bloated. What do you require for data access?
For an embedded system you might find something which matches your
needs very well and has a tiny footprint.
I can give you some B* Tree code which is suitable for a high
performance simple and lightweight embedded application or some AVL tree
code which would suit a simpler smaller scale memory resident embedded
data access application. You would have to adapt it to your
application, but could expect to get your database access in 20K or less
of executable image. Of course you have no SQL.
-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------
--
/"\
\ / ASCII RIBBON CAMPAIGN - AGAINST HTML MAIL
X - AGAINST MS ATTACHMENTS
/ \
-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------
