[VOTE] Release Apache Jackrabbit Oak 1.6.4

2017-08-15 Thread Amit Jain
A candidate for the Jackrabbit Oak 1.6.4 release is available at: https://dist.apache.org/repos/dist/dev/jackrabbit/oak/1.6.4/ The release candidate is a zip archive of the sources in: https://svn.apache.org/repos/asf/jackrabbit/oak/tags/jackrabbit-oak-1.6.4/ The SHA1 checksum of the

Re: [VOTE] Release Apache Jackrabbit Oak 1.0.39

2017-08-15 Thread Julian Reschke
On 2017-08-15 20:25, Manfred Baedke wrote: ... [X] +1 Release this package as Apache Jackrabbit Oak 1.0.39 Best regards, Julian

Release plan Oak 1.7.6

2017-08-15 Thread Amit Jain
Hi, I plan to release Oak 1.7.6 tomorrow. I will move any unresolved issues to the next releases. Let me know if there's something urgent that you want to get in and need more time. Thanks Amit

Re: [CompositeBlobStore] Delegate traversal algorithm

2017-08-15 Thread Matt Ryan
Hi Thomas et al, I’m still working through some issues on the wiki, but I updated much of it to address some of Thomas’ concerns. One area where I have simplified things has to do with the write process. But I’m not sure my line of thinking is best. Assume the data store receives a request to

Re: [CompositeBlobStore] Delegate traversal algorithm

2017-08-15 Thread Matt Ryan
Hi Thomas (and everyone else): I wanted to ask about a comment you made in the wiki where you said "Bloom filters should be mentioned (are they used, if yes how, if not why not).” I assume since you included that you are thinking they probably should be used. I believe the intended use of a

Re: [CompositeBlobStore] Delegate traversal algorithm

2017-08-15 Thread Matt Ryan
Hi Thomas, After emailing I saw you also provided comments in-line on the wiki. I’ll work through those and reply back on-list when I think I have addressed them. Thanks for doing that also! -MR On August 15, 2017 at 2:01:04 PM, Matt Ryan (o...@mvryan.org) wrote: Hi Thomas, Thank you for

Re: [CompositeBlobStore] Delegate traversal algorithm

2017-08-15 Thread Matt Ryan
Hi Thomas, Thank you for taking the time to offer a review. I’ve been going through the suggested readings and will continue to do so. Some comments inline below. On August 15, 2017 at 12:25:54 AM, Thomas Mueller (muel...@adobe.com.invalid) wrote: Hi, It is important to understand which

[VOTE] Release Apache Jackrabbit Oak 1.0.39

2017-08-15 Thread Manfred Baedke
A candidate for the Jackrabbit Oak 1.0.39 release is available at: https://dist.apache.org/repos/dist/dev/jackrabbit/oak/1.0.39/ The release candidate is a zip archive of the sources in: https://svn.apache.org/repos/asf/jackrabbit/oak/tags/jackrabbit-oak-1.0.39/ The SHA1 checksum of the

Re: [CompositeBlobStore] Delegate traversal algorithm

2017-08-15 Thread Thomas Mueller
Hi, It is important to understand which operations are available in the JCR API, the DataStore API, and the concept of revisions we use for Oak. For example, * The DataStore API doesn’t support updating a binary. * A node might have multiple revisions. * In the Oak revision model, you can't

Re: [CompositeBlobStore] Delegate traversal algorithm

2017-08-15 Thread Thomas Mueller
Hi, I read you wiki update, and this caught my eye: > If a match is found, the write is treated as an update; if no match is > found, the write is treated as a create. In the DataStore, there is no such thing as an update. There are only the following operations: * write * read * delete,