mrjn

24 ms·

241.
by mrjn 8y ago
I agree. And I saw how averse companies were to graph databases because of the perception that they are "not reliable." So, we built Dgraph with the same concepts as Bigtable and Google Spanner, i.e. horizontal scalability, synchr
242.
by mrjn 8y ago
As others mention, Neptune is based on Blazegraph. It is a layer on top of Amazon Aurora and has the typical graph layer issues I mention my blog post (in particular the join depth problem). When Neptune was launched, I wrote another articl
243.
by mrjn 8y ago
Google's graph serving system is not generally available to be used by other teams, because its custom-built just for one purpose: to serve knowledge as part of web search infra. I think if Blaze is using some graph solution, it must b
244.
by mrjn 8y ago
Hi all, author of Dgraph and the article here. Glad to see this post trending on HN. I'm around if you want to ask any questions, and will share whatever I can about my experience with graphs and the decisions at Google. Since leaving
245.
by mrjn 8y ago
When GC is run, it does lookups in the LSM tree. We first do a small number of lookups to sample the file -- if the sample indicates that the data can be GCed (based on the discard ratio), only then does the GC go over the entire file. In a
246.
by mrjn 8y ago
Author of Badger here. Thanks for posting this! We have built some pretty unique things into Badger, and this post talks about those features and how they're being used within Dgraph ( https://dgraph.io ). And as we build mor
247.
by mrjn 8y ago
Ah.. didn't know about the effort at TiDB to put this in RocksDB. They surely can learn from our efforts.
248.
by mrjn 8y ago
Based on the commit you made, looks like there was a build breakage on a 32-bit system. We've resolved all known issues with 32-bit systems. Let us know if you encounter more.
249.
by mrjn 8y ago
Lack of value log GC won't affect performance directly, but every write would write to the value log GC, hence increasing its size. So, a GC is needed to deal with the growing size.
250.
by mrjn 8y ago
Mmaping is optional. Badger doesn't require it, it gives you that option. Async IO in Go has been debated vigorously over the years, but there're little benefits in building that library. Because Goroutines do an equivalent job. W
251.
by mrjn 8y ago
You can keep both the value log and LSM tree in memory, exposed by badger.Options. That'd still give you persistence and crash-resilience while allowing your reads to benefit from direct memory access. If persistence is a non-goal, yea
252.
by mrjn 8y ago
I've been thinking of writing a paper about Badger in general and in particular, our experiments with perfecting the value log GC while keeping the 3-dimensional access provided by Badger (RocksDB doesn't provide direct iteration
253.
by mrjn 8y ago
As mentioned in my top comment, we have run benchmarks again. SyncWrites on or off, Badger outperforms BoltDB. There's a nice ASCIIrema link that you can see, which is a recording of me running Ethereum 2.0 store benchmarks.
254.
by mrjn 8y ago
Follow on 3. Or, at the very least, it is no better than using skiplists in memtables for key insertion (LSM design), and then compacting them away in the tree levels.
255.
by mrjn 8y ago
1. (author) That's how WiscKey did it. But, they omitted a lot of details around how an online value log garbage collection would work. Offline GC doesn't work for most users. On top of that, Badger supports 3-dimensional data acc
256.
by mrjn 8y ago
(Author of Badger here) First of all, thanks to the growing Go community for using Badger. Within a short period of time since the original announcement [-1], Badger has become very popular. A lot has changed since the original post. Despit
257.
by mrjn 8y ago
Author of Badger here. Our design of separating keys and values has gotten us incredibly fast writes, while still keeping the read latencies neck-to-neck against B+ trees. Worth checking out: https://github.com/dgraph-io&#x2
258.
by mrjn 8y ago
(Author of Dgraph here). To Drew Devault: Just came across this article, and there's no comments section in your blog post. > Finally, I have some praise to offer. Dgraph was briefly licensed under Apache plus the Commons Clause, an
259.
by mrjn 8y ago
(author of Dgraph and Badger here) Congrats to Neo4j on the raise! I hope it changes the perception of US VCs w.r.t. graph DBs, who are falling behind the dev enthusiasm and readiness for adoption in this field. As Jepsen report mentioned,
260.
by mrjn 8y ago
Dgraph currently does not support OpenCypher.
261.
by mrjn 8y ago
Yeah, we're working on fixing the existing bugs and working with Kit Patella ( https://github.com/mkcp ) to further extend Jepsen's Dgraph tests. The Snapshot Isolation bank test bug, in particular, is proving a lot
262.
by mrjn 8y ago
Thank you! This is the best acknowledgment of our work I've seen so far. A lot of blood, sweat, hairs, frustrations, and tears has gone into building Dgraph -- and this comment by you makes me feel proud of what we're building, an
263.
by mrjn 8y ago
None were found based on Jepsen testing done. We had done a separate testing for Badger before Jepsen, where we had identified and fixed a few issues related to crashes. You can read that blog post here: https://blog.dgraph.io&#x
264.
by mrjn 8y ago
First, to be clear, we are the authors of this software, so our responsibility is to choose our license terms and clearly communicate them to those who want to use the software. We have done that and we are obviously not trying to mislead
265.
by mrjn 8y ago
Author of https://dgraph.io here. I'd say this is one of the best collaborations we've done. Due to Jepsen tests, we were able to proactively identify and fix issues in a complex real time distributed graph DB, that is
266.
by mrjn 8y ago
We changed the references to say liberally licensed. I'll try and write a bigger blog post about the reasoning behind Commons Clause and Dgraph and other companies' adoption of it.
267.
by mrjn 9y ago
Not only do I think there's a lot of benefit in representing data for which the schema is already fixed, we've actually gone to the extent of showing this by building a whole replica website for Stack Overflow. https://
268.
by mrjn 9y ago
Yeah, we were doing that with intermediate nodes. So, Bob -worked_at-> Work node Work node -from-> date Work node -to-> date Work node -employer-> WB, Disney, etc. Then each instance of Bob working would be a node in the graph.
269.
by mrjn 9y ago
There is a lot of stigma attached to graph DBs. Would it provide good performance? Should I ever use it as my primary database? Is my data ever safe with a graph DB? If we go beyond that, assuming there was one which provided great performa
270.
by mrjn 9y ago
Dgraph Labs (dgraph.io) | Developer Advocate / Senior backend Engineers | San Francisco, CA | ONSITE, VISA, Full-time, USD 120-180K + equity Dgraph is the world’s most advanced graph database. It is horizontally scalable, synchronously

More ›