Ben Bromhead sent an email to me directly and expressed an interest in seeing
some of my queries. I may as well post them for everyone. Here are my queries
for the part of my code that reads and cleans up browse trees.
@NamedCqlQueries({
@NamedCqlQuery(
name =
Fascinating. Both the mysql front and and this delightful inverted search
solution. Your creativity makes me wonder what other delights your query
solutions might expose!!
sent from my mobile
Daemeon C.M. Reiydelle
USA 415.501.0198
London +44.0.20.8144.9872
On Mar 27, 2015 7:08 PM, Robert Wille
that's neat, thanks for sharing.
sounds like the solution is partly inspired by merkle tree to make lookup
fast and easy.
peter
On Fri, Mar 27, 2015 at 10:07 PM, Robert Wille rwi...@fold3.com wrote:
Okay, this is going to be a pretty long post, but I think its an
interesting data model, and
Hi Robert,
We're trying to do something similar to the OP and finding it a bit
difficult. Would it be possible to provide more details about how you're
doing it?
Thanks.
On Fri, Mar 27, 2015 at 3:15 AM, Robert Wille rwi...@fold3.com wrote:
I have a cluster which stores tree structures. I keep
On 3/26/15 10:15 PM, Robert Wille wrote:
I have a cluster which stores tree structures. I keep several hundred unrelated
trees. The largest has about 180 million nodes, and the smallest has 1 node.
The largest fanout is almost 400K. Depth is arbitrary, but in practice is
probably less than
I'd be interested to see that data model. I think the entire list would
benefit!
On Thu, Mar 26, 2015 at 8:16 PM Robert Wille rwi...@fold3.com wrote:
I have a cluster which stores tree structures. I keep several hundred
unrelated trees. The largest has about 180 million nodes, and the smallest
+1 would love to see how you do it
On 27 March 2015 at 07:18, Jonathan Haddad j...@jonhaddad.com wrote:
I'd be interested to see that data model. I think the entire list would
benefit!
On Thu, Mar 26, 2015 at 8:16 PM Robert Wille rwi...@fold3.com wrote:
I have a cluster which stores tree
Hmmm... If you serialize the tree properly in a partition, you could always
read an entire sub-tree as a single slice (consecutive CQL rows.) Is there
much more to it?
-- Jack Krupansky
On Fri, Mar 27, 2015 at 7:35 PM, Ben Bromhead b...@instaclustr.com wrote:
+1 would love to see how you do it
Okay, this is going to be a pretty long post, but I think its an interesting
data model, and hopefully someone will find it worth going through.
First, I think it will be easier to understand the modeling choices I made if
you see the end product. Go to
I have a cluster which stores tree structures. I keep several hundred unrelated
trees. The largest has about 180 million nodes, and the smallest has 1 node.
The largest fanout is almost 400K. Depth is arbitrary, but in practice is
probably less than 10. I am able to page through children and
Not sure if this is the right place to ask, but we are trying to model a
user-generated tree hierarchy in which they create child objects of a
root node, and can create an arbitrary number of children (and children
of children, and on and on). So far we have looked at storing each tree
11 matches
Mail list logo
