HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
cayleygraph
cayley
Go2014–2020
cayleygraph / cayley

cayley

An open-source graph database

22Distinct people
33Mentions
0Explicit recommenders
15.1KGitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

An open-source graph database

GitHub

Where it is used

No documented product use was verified in the last source check.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 8–Nov 15 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/15/2026, 11:34:28 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year33 dated mentions

Observed mentions: 2014-06-25 22:01:06 UTC to 2020-08-11 07:58:26 UTC.

02468102014-01-01 00:00:00 UTC to 2015-01-01 00:00:00 UTC (exclusive): 4 mentions; 2 submissions, 2 comments20142015-01-01 00:00:00 UTC to 2016-01-01 00:00:00 UTC (exclusive): 8 mentions; 2 submissions, 6 comments2016-01-01 00:00:00 UTC to 2017-01-01 00:00:00 UTC (exclusive): 9 mentions; 2 submissions, 7 comments2017-01-01 00:00:00 UTC to 2018-01-01 00:00:00 UTC (exclusive): 8 mentions; 1 submissions, 7 comments20172018-01-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2019-01-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2020

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
20142014-01-01 00:00:00 UTC2015-01-01 00:00:00 UTC422
20152015-01-01 00:00:00 UTC2016-01-01 00:00:00 UTC826
20162016-01-01 00:00:00 UTC2017-01-01 00:00:00 UTC927
20172017-01-01 00:00:00 UTC2018-01-01 00:00:00 UTC817
20182018-01-01 00:00:00 UTC2019-01-01 00:00:00 UTC101
20192019-01-01 00:00:00 UTC2020-01-01 00:00:00 UTC101
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC202

What Hacker News says

8 sources
Hey, maintainer of Cayley ( https://github.com/google/cayley ) here. Glad to see more people interested in this space! It looks like your code is mostly stubbed out right now -- using gorm for any persistence. You'll find that storing a basic graph is easy; doing more complex traversals and optimization is a harder problem. I can appreciate your concept of experimenting with adding monetary incentives on top of requests and datasets. Graphs can be a useful for this, if you view a graph as a (requestable) URI of triples. I'd recommend linking in Cayley as your backend (you can use it as a library), and dealing with the requests/economics as an API layer on top. The benefit of open source is you don't have to reimplement everything yourself. And if you have novel notions on how to distribute a graph that could be interesting, feel free to p
Read the rest
ing me. I warn you that it's a hard problem and bold claim in a number of ways -- it's not something you just build without working with a couple people.
In DegDB, an open-source distributed graph database
If you want to help hack on this, I've written a Postgres backend for the graph database Cayley that's fairly fast and about to merge (for use on a prod feature): https://github.com/google/cayley/pull/289 For traversals, it tries its level best to let Postgres create the appropriate JOINs, which Postgres does well... most of the time anyway. In doing this, I learned really fast how many weird semantic corners of bog-standard SQL are, and the optimization choices Postgres makes based on the way you formulate the query. Ping me on that PR! And/or join #cayley on Freenode
In Ask HN: Implementing a graph database using Postgres tables for nodes and edges?
Very much so! I'd love some help writing/documenting/explaining to people a lot of the work I've done behind Cayley (http://github.com/google/cayley). I can explain it very well one-on-one or to a developer but my writing/explaining/diagramming gets a little esoteric for the people at large. Even planning/prioritizing some things would be useful. So if graph databases strike you as cool new technologies and you'd like to learn more, check it out and feel free to drop me a line personally at barak (at) cayley.io
In Ask HN: How do technical non-developers help with open source projects?

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.