Earlier quoted context omitted.
> No, the AGPL uses strong copyleft, so any future derivative work must be released under the same terms (and the same license or later versions if I'm not mistaken). The only possibility is to start a closed source clone that doesn't use any of the original code from zero. Slava @ RethinkDB here. This has one exception -- the copyright owner can choose to start releasing enhancements as closed source, and they would…
One caveat with this: if your project is open source and has accepted submissions from non-affiliated entities, you would either need to get them to assign the rights to that code to RethinkDB or remove them from the source if you were to relicense under something that would break the AGPL. This is where things like code releases come in. This is also why many open source startups don't accept code submissions from o…
RethinkDB 2.0 is now production ready
121–130 of 156 posts
Re: RethinkDB 2.0 is now production ready
#122Earlier quoted context omitted.
Daniel @ RethinkDB here. As you mention, RethinkDB is fully open source so RethinkDB is always going to remain freely available.
Quick question: How would RethinkDB benefit an E-Commerce shop?
Re: RethinkDB 2.0 is now production ready
#123Earlier quoted context omitted.
We did a couple of scalability improvements in 2.0, but didn't optimize groups and counts specifically. Would you mind writing me an email with your query or opening an issue at https://github.com/rethinkdb/rethinkdb/issues (unless you have already?)? I'd like to look into it to see how we can best improve this. We're planning to implemented a faster count algorithm that might help with this ( https://github.com/reth…
What I was doing is so trivial, you don't really need this information. This was my reference SQL query: select path, count(*) from posts group by path; (I don't have the exact Rethink query written down, but it was analogous to the SQL version.) You can demonstrate RethinkDB's performance issue with any largeish dataset by trying to group on a single field. The path column in this case has a cardinality of 94, and t…
Re: RethinkDB 2.0 is now production ready
#124Earlier quoted context omitted.
What I was doing is so trivial, you don't really need this information. This was my reference SQL query: select path, count(*) from posts group by path; (I don't have the exact Rethink query written down, but it was analogous to the SQL version.) You can demonstrate RethinkDB's performance issue with any largeish dataset by trying to group on a single field. The path column in this case has a cardinality of 94, and t…
Are you sure the analogous RethinkDB query was using the index? Iirc it's not enough just to use the column name (or wasn't, I don't keep up).
Re: RethinkDB 2.0 is now production ready
#125Earlier quoted context omitted.
Are you sure the analogous RethinkDB query was using the index? Iirc it's not enough just to use the column name (or wasn't, I don't keep up).
It wasn't using an index, but then Postgres wasn't, either. I don't think aggregating via B-tree index is a good idea; aggregation is inherently suited to sequential access. An index is useful only when the selectivity is very low.
Re: RethinkDB 2.0 is now production ready
#126Earlier quoted context omitted.
I hear you talk a lot about real-time — I guess that's a niche that you noticed. But let me add to that: being "distributed" without major pain is also big. There is a niche to be filled on the (loosely defined) "distributed" spectrum between, say, Redis and Cassandra, and so far you seem to be heading right for that place. I like that a lot and plan to use RethinkDB for a number of projects in the near future.
What about Couchbase? Specifically for the niche on the spectrum between Redis and Cassandra.
Re: RethinkDB 2.0 is now production ready
#127Earlier quoted context omitted.
Couchbase has indexing, map reduce, and full text. Also a mobile sync connector.
Couchbase conflict resolution is really basic, assuming you mean distributed in a wan context (eg xdcr). Riak would represent the state of the art in this respect (random internet endorsement, I'm not affiliated with anything, just a user who has worked with both systems).
Re: RethinkDB 2.0 is now production ready
#128Is windows support coming anytime?
Re: RethinkDB 2.0 is now production ready
#129Re: RethinkDB 2.0 is now production ready
#130Earlier quoted context omitted.
It wasn't using an index, but then Postgres wasn't, either. I don't think aggregating via B-tree index is a good idea; aggregation is inherently suited to sequential access. An index is useful only when the selectivity is very low.
If you wrote your query with group and count, with no index, then there would be problems with the performance. RethinkDB generally does not do query optimization, except in specific ways (mostly about distributing where the query is run), unless that's changed very recently. You can write that query so that it executes with appropriate memory usage with a map and reduce operation.