rajman187

14 ms·

151.
by rajman187 8y ago
I quit (delete not deactivate) 8 years ago for free it's been great.
152.
by rajman187 8y ago
Begging the question has nothing to do with raising a question, it's a type of logical fallacy. And it's also annoying to see misused. /Pedantry
153.
by rajman187 8y ago
The only thing I did was find the hiring managers for jobs I was interested in, but to be honest you don't even need premium for that. It's blending more and more into some generic social media monstrosity and wild west playground
154.
by rajman187 8y ago
Off topic but annoying (and pedantic on my part) nonetheless, "begging the question" does not mean what the author seems to think.
155.
by rajman187 8y ago
Presumably built on top of blazegraph? Of course they've modified tinkerpop so there is an aws variant of Gremlin... Any chance of seeing a spark connector for massive writes?
156.
by rajman187 9y ago
but has the bug in fMRI software been fixed ? https://www.sciencealert.com/a-bug-in-fmri-software-could-in...
157.
by rajman187 9y ago
Definitely. It's very nice to do large jobs in such a scalable manner. And interacting with databases is very straightforward. I'd also recommend Scala especially if using Spark. I've grown to like it as much if not more than
158.
Graph databases help agencies spot relationships across silos(gcn.com)
1 points by rajman187 9y ago|0 comments
159.
by rajman187 9y ago
I can confidently state that Tucson is indeed the best city in the united states.
160.
by rajman187 9y ago
I'm familiar with Marko and his arguments hence my quotes around "native" ;) But it sounds fantastic for marketing
161.
by rajman187 9y ago
Gremlin is indeed the query language but requires a gremlin engine. This is generally passing strings to the DB (which gives you advantages like pushdown-predecate, essentially DB-side filtering) but there is associated overhead with someth
162.
by rajman187 9y ago
There are two main paradigms here 1) "native" graph db Neo4J is an example of this. This takes advantage of index-free adjacency. Each node knows what other nodes it is connected to and hence traversals are very fast. The issues y