chaindb btrees

Discussions related to Visual Prolog
Kolly Adex
Posts: 2
Joined: 20 Feb 2010 6:48

chaindb btrees

Unread post by Kolly Adex » 26 Oct 2013 18:45

What dues 'chaindb btrees' stand for?

User avatar
Thomas Linder Puls
VIP Member
Posts: 1174
Joined: 28 Feb 2000 0:01

Unread post by Thomas Linder Puls » 27 Oct 2013 14:53

The term chainDb is short for chain database, which as the name indicates is a database (of terms) where the data is stored in chains. But how the database is structured internally is not really important. The important thing is that a chainDb is a term storage, and that it (provided the terms does not contain predicates or objects) can be stored persistently in a disk file.

bTree is short for B+ tree and is a special kind of indexes that are well suited for storing in fixed size blocks like disk blocks.

We do not encourage the use of these data storage means anymore, they are mainly available for backwards compatibility.

For in-memory (non-persistent) data handling you should use object, fact databases and the especially collection library (maps, sets, queues, ...). And for persistent (across sessions, users, etc.) data storage we strongly recommend using a real database and especially to remember to use its backup facilities.

So my recommendation is that since you are not already familiar with these things you should simply forget about them.
Regards Thomas Linder Puls

Post Reply