Live data from Hacker News

RedisGraph: a fast, queryable property graph database for Redis

oss.redislabs.com

11–20 of 34 posts

Re: RedisGraph: a fast, queryable property graph database for Redis

#11
post #2

Just a warning that this is one of the modules that's licensed under the controversial "Apache 2.0 with Commons Clause" license.

More information about the Commons Clause can be found here [1]. TL;DR: May I create, distribute, offer as SaaS, and/or “sell” my products using Commons Clause licensed components? Yes. Is it open source? No. [1] https://commonsclause.com

[dead]

Re: RedisGraph: a fast, queryable property graph database for Redis

#15
post #2

Just a warning that this is one of the modules that's licensed under the controversial "Apache 2.0 with Commons Clause" license.

This motivated me to reread the commons clause again. I remain so disappointed in the naming and positioning of it. If you want to sell commercial modules that is totaly fine, but Apache 2 with commons doesn’t jump off the page as an unfree license (which prima facia it is). Should be called the ‘free for personal use’ email us for pricing clause instead.

I'm not a fan of combining licences - it's just confusing. They should come up with some new license like the "totally free if you're not reselling it as a service" license or something like that.

"The large print giveth, the small print taketh away".

Re: RedisGraph: a fast, queryable property graph database for Redis

#16
post #3

I'm pretty uninformed on the subject, but I am interested to hear why an adjacency matrix is chosen over an adjacency list when it is sparse. My basic data structures and algorithms class would lead me to believe that an adjacency list would be better. Is this due to the nature of how the database is constructed?

The underlying representation is a sparse adjacency matrix. The graph that it is representing is not necessarily sparse.

True, although most "organic" graphs are sparse.

Re: RedisGraph: a fast, queryable property graph database for Redis

#17
post #2

Just a warning that this is one of the modules that's licensed under the controversial "Apache 2.0 with Commons Clause" license.

Common Clause is a deceptive villainous virus spreading its way through the community.

If you want an graph DB alternative that is truly Open Source (MIT/ZLIB/Apache2) try ours ( https://github.com/amark/gun ).

Re: RedisGraph: a fast, queryable property graph database for Redis

#18
post #3

I'm pretty uninformed on the subject, but I am interested to hear why an adjacency matrix is chosen over an adjacency list when it is sparse. My basic data structures and algorithms class would lead me to believe that an adjacency list would be better. Is this due to the nature of how the database is constructed?

Another reason has to do with memory access and cache invalidation, when working with sparse matrices the entire graph structure is laid out in a contiguous block of memory which is ideal for CPU caching, unlike adjacency list where you have lots for small allocations scattered all over the memory space, this makes a huge difference when traversing the graph.

Re: RedisGraph: a fast, queryable property graph database for Redis

#19

"Fast". Compared to what? How does it perform compared to Neo4j? How do you scale it?

https://twitter.com/dvirsky/status/1053987868677423104

Comparing RedisGraph (an in-memory db) to Neo4j, which does not need to hold the entire graph in-memory, is not really fair though.
Post reply on HN