4 ms·
But if you want to scale to more than two instances you will have to pay a $50k license. $50.000,00 dollars. Which is far too expensive for startups.
by LunaSea 11y ago
But if you want to scale to more than two instances you will have to pay a $50k license. $50.000,00 dollars. Which is far too expensive for startups.
- PaulRobinson 11y agoI didn't pay $50k. Make them an offer. Seriously.
- rspeer 11y agoLook, I only wrecked a semester of research by chasing the slippery promises of graph databases. Don't wreck your entire startup on them.
- grandalf 11y agoExplain
- rspeer 11y agoConceptNet [1] started out as an academic project that I was responsible for for a while. Since then I've left to start a company but I still maintain ConceptNet and build lots of stuff on it. [1] http://conceptnet5.media.mit.edu http://conceptnet5.media.mit.edu Here's a list of databases, some of them graph databases, some of them barely databases, where I've tried to store and look up edges of ConceptNet: - SQLite - PostgreSQL - MongoDB - Some awful IBM quad-store - HypergraphDB - Tinkerpop - Neo4J - Solr - Riak - SQLite with APSW to speed up importing - Just a hand-rolled hashtable on disk Here are the systems that have succeeded to any extent, in that I could do simple things with them and they didn't collapse: - PostgreSQL - SQLite with APSW to speed up importing - Just a hand-rolled hashtable on disk The time when I tried Tinkerpop, HypergraphDB, and Neo4J because I had a graph and graph databases are supposed to be good at graphs was particularly terrible. Graph databases seem to only be good at dealing with graphs so small that anything can deal with them. If this has changed, please point me at an open-source graph database that's not terrified of gigabytes. (No trying to sell me SaaS, please.)
- akarambir 11y agoCan you explain how you were using PostgreSQL as Graph Database?
- rspeer 11y agoI mean, I was putting a graph in PostgreSQL, I don't know if that makes it a "graph database". Table of nodes, table of edges.
- espeed 11y agoFYI: See this recent paper by Google Research and IBM Watson Research: SQLGraph: An Efficient Relational-Based Property Graph Store http://research.google.com/pubs/archive/43287.pdf http://research.google.com/pubs/archive/43287.pdf Previous discussion: https://news.ycombinator.com/item?id=11101013 https://news.ycombinator.com/item?id=11101013
- amirouche 11y agoKnowing the ConceptNet project a little, still I don't understand the workload/algorithms you run on the database. Otherwise said, «this doesn't work for us» doesn't help anybody. It really depends on the kind of algorithm you run on the database. Based on open source project, in read/write mode, no db can help you since you load everything into memory. As a noob NLP user, I rather use something like AjguDB https://github.com/amirouche/ajgudb https://github.com/amirouche/ajgudb
- grandalf 11y agoIt's interesting. I suppose most graph db operations could be easily enough broken down into a series of steps that could be performed in a more scalable but slower way. Did your hand-rolled hashtable have any characteristics that would make its performance characteristics difficult for a smarter optimizer (if such a thing existed in Neo4j)? Can you psudocode an example slow query/operation and indicate how many edges/vertices were being considered at each step? Sorry to ask these kinds of questions, I'm just really curious about the situation you described.
- 11y ago
- raccer 11y agoNot entirely accurate. They have a startup program. Neo4j Enterprise is available for free for startups up to 20 employees. Source: http://neo4j.com/startup-program/ http://neo4j.com/startup-program/