Christian,

Concerning this topic, it took me a whole week of quite hard work to write a Red / Black removable tree written in XQUERY, together with a map interface that mimic the basex one. However I won't go public, and would advise not to use it, because it suffers from performance issues.

I opened a thread concerning this perf issue, that might be deeper that I thought.

Cheers,

Jean-Marc



2013/11/21 Christian Grün <christian.gruen@gmail.com>
>>Sounds interesting. Have you thought about making it public to get
>> more feedback?
> I will, as soon as it will be tested... I need to implement a
> remove($map,$key) function, meaning that I have to re-implement the whole
> BRTree...This will take some time (2 days works I guess to have a clean
> implementation), to find into my agenda :)

That would be fast anyway… I’m looking forward to the result!
Christian


>>It’s an implementation of Phil Bagwell’s immutable hash tries (as
>>mentioned in your previous thread…):
> Oops..sorry, my linker is slow sometime ;) Thanks for your patience
>
>
> 2013/11/21 Christian Grün <christian.gruen@gmail.com>
>>
>> > 1) I implemented in pure XQUERY 3.0 a map having the desired behavior. I
>> > can
>> > now define optionally an ordering function, and thus is able to insert
>> > nodes, maps, sequences. It is very useful for a lot of things. I would
>> > not
>> > recommend to external person to use it at present time (not tested,
>> > functionalities to add, bugs suspected), but I can provide the file on
>> > demand.
>>
>> Sounds interesting. Have you thought about making it public to get
>> more feedback?
>>
>> > 2) A question about the BaseX map module : what kind of tree technology
>> > is
>> > used behind ?
>>
>> It’s an implementation of Phil Bagwell’s immutable hash tries (as
>> mentioned in your previous thread…):
>>
>>
>> https://github.com/BaseXdb/basex/tree/master/basex-core/src/main/java/org/basex/query/value/map
>>
>> Christian
>
>