Hello, After reading, studying the docs and examples, I have a few questions about picolisp database, please :
Is an +Index prefix class required to get a searchable B-Tree associated to the relation or are these classes just provided for convenience : insuring unicity, formatting indexes (keys?) (like +Fold or +Sn)? Can an +Entity have more than one unique index? Is this advised? If the unicity of an +Entity relies on more than one non unique index, should they be merged with +Any or +Bag or is this case dependant ? Calling (tree 'relation +EntityClass) provides access to all the subclasses of +EntityClass, doesn't it? Some examples in the html documentation (for +Hook, for example) seem to refer to a more complex demo than the one included in picolisp distribution : does such a demo exists and is it available? Thanks, Denis ---------------------------------------- > From: denis.p...@hotmail.com > To: picolisp@software-lab.de > Subject: RE: The database as a "dictionary"? > Date: Sun, 22 Nov 2015 16:56:14 -0500 > > Yes, everybody knows this data structure, but the name is rather confusing. > Thanks. > > Denis > > ---------------------------------------- >> From: olopie...@gmail.com >> To: picolisp@software-lab.de >> Subject: Re: The database as a "dictionary"? >> Date: Sun, 22 Nov 2015 05:28:35 +0100 >> >> On Sat, Nov 21, 2015 at 10:37 PM, Denis Fourt <denis.p...@hotmail.com> wrote: >>> B-Tree means binary tree or balance tree? >> >> Nobody knows the meaning of the B. >> >> https://en.wikipedia.org/wiki/B-tree >> -- >> UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe > -- > UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=subscribe -- UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
