On Feb 25, 2010, at 1:06 PM, Jeff Johnson wrote:
>
> One easy (if you're an OCAML programmer, alas not me yet) thing to try
> would be to try adding DB_RMW to the read cursor flags. That should
> take out a WRITE lock instead and (one hopes) that Berkeley DB will
> then avoid the deadlock.
>
A
On Feb 25, 2010, at 9:29 AM, Jeff Johnson wrote:
>>
>> Deadlock diagnosis is described in chapter 11 here:
>>
>>
>> http://www.oracle.com/technology/documentation/berkeley-db/db/programmer_reference/index.html
>>
>> The db_stat I captured (I have the full file if interested) showed
>> a p
On Feb 25, 2010, at 7:22 AM, Yaron Minsky wrote:
>
> The use of the prefix tree is described in the two articles Set
> Reconciliation with Nearly Optimal Communication Complexity and
> Practical Set Reconciliation. You will find them on the Google code
> page¹. The mathematics are quite involv
I invariably forget to hit Reply-All ... apologies.
Begin forwarded message:
> On Feb 24, 2010, at 6:01 PM, Kim Minh Kaplan wrote:
>
>> Jeff Johnson:
>>
>>> BTW, can someone describe -- even superficially -- what is
>>> being attempted with the PTree store? Any details are welcomed,
>>> I'm not
On Wed, Feb 24, 2010 at 6:01 PM, Kim Minh Kaplan
> wrote:
> Jeff Johnson:
>
> > BTW, can someone describe -- even superficially -- what is
> > being attempted with the PTree store? Any details are welcomed,
> > I'm not yet able to read OCAML code well enough to recognize
> > what type of store is
