Top all-time · #7942
Max De Marzi
Personal blog · maxdemarzi.com · on HN as maxdemarzidataprogramming
Max De Marzi's personal blog at maxdemarzi.com covers data and programming. Since 2012, 10 different Hacker News readers have linked it 55 times, most often “Importing the Hacker News Interest Graph in Neo4j”. It is still writing: the last post was on 2026-10-30, and you can follow it by feed.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN readers link Max De Marzi's posts on graph database performance, including 'death star' queries and vendor benchmarking, which commenters discuss in relation to Neo4j and GraphBLAS.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Graphs, Graphs, and nothing but the Graphs
Most-linked posts?
- Importing the Hacker News Interest Graph in Neo4j2 people · 2 mentions · first linked 2016-06-13
- /2023/01/09/death-star-queries-in-graph-databases/2 people · 2 mentions · first linked 2023-01-13
What Hacker News says?
Show me where to get doctor case history and I can do the matching website for you => http://maxdemarzi.com/2012/10/18/matches-are-the-new-hotness...
Comment linking /2012/10/18/matches-are-the-new-hotness/
on “Why the Fuck?”Submitted Graphs - When 2D is not enough, Three.js and Neo4J as a story · 33 points
HN discussionGot an opportunity to do this recently using a graph mapped on to a K^2 Tree to find out if a relationship existed or not. See https://maxdemarzi.com/2016/12/27/connected-2/
Comment linking /2016/12/27/connected-2/
on “Why recursive data structures?”Submitted The Hacker News Interest Graph as a story · 6 points
HN discussionAnecdote agreeing with the OP. I used to get 10k visitors a month in 2015, that dropped to 7.5k in 2016 and currently get about 5k a month even though the niche I talk about has gotten more and more popular (Neo4j). Nearly all my posts are technical and link to source code. Maybe there are just more bloggers about Neo4j. http://maxdemarzi.com
Comment linking /
on “Ask HN: Has attracting a blog audience become harder?”Submitted Decision Graphs as a story · 4 points
HN discussion>>And the last time I tried to load my multi-million-edge dataset into Neo4j through its documented API, I estimated that it would have taken several weeks to finish. Use the Import tool, it can do a million writes a second. Here is how to import hacker news into Neo4j using it: https://maxdemarzi.com/2015/04/14/importing-the-hacker-news-...
Comment linking /2015/04/14/importing-the-hacker-news-interest-graph/
on “Cayley – An open-source graph database”Submitted Building your own Multi-Model Database – Part 1 as a story · 4 points
HN discussionDon’t ever trust any vendor benchmarks: https://maxdemarzi.com/2015/10/16/benchmarks-and-supercharge...
Comment linking /2015/10/16/benchmarks-and-superchargers/
on “Performance Benchmark 2018 – MongoDB, PostgreSQL, OrientDB, Neo4j and ArangoDB”Submitted The Logic Graph Epiphany as a story · 3 points
HN discussionAnother 1M q/s nonsense benchmark to add to the list : http://maxdemarzi.com/2015/10/16/benchmarks-and-supercharger...
Comment linking /2015/10/16/benchmarks-and-superchargers/
on “MariaDB 10.1 can do 1M queries per second”Submitted The Iraq War of Computer Science as a story · 3 points
HN discussionYou can mix rule based systems and decision trees (well, decision streams) quite nicely in a Graph. Watch the 15 min video on https://maxdemarzi.com/2018/10/08/dynamic-rule-based-decisio... for more details.
Comment linking /2018/10/08/dynamic-rule-based-decision-trees-in-neo4j-part-3/
on “CLIPS: A Tool for Building Expert Systems”Submitted Flight Search with Neo4j as a story · 3 points
HN discussionIf anybody wants a little more code with their blog post, here is another example http://maxdemarzi.com/2014/02/12/online-payment-risk-managem... A proper fraud detection system has lots of pieces. The one the customer was having trouble with was Cross Reference in real time. Imagine 10k requests per second coming in, you can use cross reference to flag transactions for further analysis or as a partial weight to mor…
Comment linking /2014/02/12/online-payment-risk-management-with-neo4j/
on “Using Graph Databases to Stop E-commerce Fraud in Real Time”Submitted Using a K^2 Tree to check relationships faster as a story · 3 points
HN discussionI blog about Neo4j and the things you can do with it => http://maxdemarzi.com/ Also, all the code you see on the blog and then some is open sourced and available on github => https://github.com/maxdemarzi?tab=repositories
Comment linking /
on “Graph databases and Python”Submitted VisualSearch.js + Neo4j 2.0 = Visual Graph Search as a story · 3 points
HN discussionThis is over a year old, and using ancient versions of software. It would be nice if they showed their testing code not just some horrific and unreadable gremlin queries. Taking 1.6 seconds to create a new node in neo4j and 2.5 to update it? Yeah, I don't think that's anywhere close to legit. Never met a vendor benchmark that wasn't faulty in some way... http://maxdemarzi.com/2015/10/16/benchmarks-and-supercharger...
Comment linking /2015/10/16/benchmarks-and-superchargers/
on “SQLGraph: An Efficient Relational-Based Property Graph Store (2015) [pdf]”Submitted Show HN: How to build your own Facebook Graph Search with Cypher and Neo4j as a story · 3 points
HN discussionYou must have missed something because that is the opposite of what it being said here. The graph model is more declarative than the so called relational model. In the graph, this node here represents Bob, this one Alice, Alice is Bob's manager. (alice)-[:MANAGES]->(bob) The query costs you 1 traversal from one node to another, a minuscule cost regardless of size. O(1) your cost stays the same no matter how many emp…
Comment linking /2012/08/13/neo4j-internals/
on “Data Modeling in Graph Databases: Interview with Jim Webber and Ian Robinson”Submitted How are investors connected? - Crunchbase on Neo4j as a story · 3 points
HN discussionIf you are dealing with lots of hierarchical data, then I recommend you take a look at Neo4j (or other graph databases) since they are much better suited for these kind of queries as well as updates at any level and multi parent hierarchies. See https://maxdemarzi.com/2016/10/27/catalogs-and-hierarchies/ for a quick example. Read until the end 'cause the kicker is being able to go UP a hierarchy in no time at all. S…
Comment linking /2016/10/27/catalogs-and-hierarchies/
on “Models for hierarchical data (2010)”Submitted Matches are the New Hotness as a story · 3 points
HN discussionGraph Search at Facebook scale is hard. They have to use tricks to get relevant results quickly. WeakAnd, StrongOr to limit connectedness. If you are working on a smaller scale... it's easier. Post: http://maxdemarzi.com/2013/01/28/facebook-graph-search-with-... Code: https://github.com/maxdemarzi/neo_graph_search Demo: http://neographsearch.maxdemarzi.com/
Comment linking /2013/01/28/facebook-graph-search-with-cypher-and-neo4j/
on “Unicorn: A System for Searching the Social Graph [pdf]”Submitted Let’s build something Outrageous – Part 17: Bulk Traversals as a story · 2 points
HN discussionMay want to take a look at using a Cuckoo Filter instead of a Bloom Filter. See https://maxdemarzi.com/2017/07/13/using-a-cuckoo-filter-for-...
Comment linking /2017/07/13/using-a-cuckoo-filter-for-unique-relationships/
on “Déjà vu: Fast efficient probabilistic deduplication”Submitted Transmuting documents into graphs with OpenNLP as a story · 2 points
HN discussionI wrote one of the Ruby bindings (Neography Gem) and write about Neo4j on my blog http://maxdemarzi.com . Also ThoughtWorks is using it and writing about it: http://www.markhneedham.com/blog/2012/04/20/neo4j-searching-...
Comment linking /
on “Neo4j 1.7 Released”Submitted Using a Cuckoo Filter for Unique Relationships as a story · 2 points
HN discussion