Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
AndrewBowman
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
AndrewBowman
4y ago
There were 2 emails sent, you must have seen the screenshot from the first one only. The second one was notification that they would be charging our "prepaid accounts" the next day (Saturday Sept 17) for the next month's serv
2.
▲
by
AndrewBowman
4y ago
The purpose of a license is to grant rights under conditions to those who would otherwise have no rights to use or modify the software at all. As the copyright owner, you already have full rights to use the code you wrote the way you want,
3.
▲
by
AndrewBowman
5y ago
I wouldn't say relational databases are poorly designed, any more than saying a hammer is poorly designed because it makes for a bad screwdriver. A hammer is still excellent at working with nails, it's hard to find a better tool t
4.
▲
by
AndrewBowman
5y ago
To propose a different perspective, a relationship in a graph db is like a materialized join. You pay on relationship creation (you might be using index lookups to find the nodes to connect, similar to a relational db), then for traversal i
5.
▲
by
AndrewBowman
5y ago
If that were so then there would be no need for native graph databases at all, and we would not be seeing cases that could not be served by relational dbs that are possible with Neo4j and native graphs. You may be thinking of non-graph use
6.
▲
by
AndrewBowman
5y ago
Hello, just making sure you're aware that while the Neo4j Sandbox is a quick way to get a feel for Neo4j and try out some tutorials and datasets, it isn't meant to be used as a general Neo4j cloud service. Your sandbox gets wiped
7.
▲
by
AndrewBowman
6y ago
The idea is not just to keep the curve low initially and then abandon all measures, but to figure out how to keep the curve consistently low over time until a vaccine or highly effective treatment is discovered. Basically, when you're
8.
▲
by
AndrewBowman
7y ago
That compares against Neo4j 1.9.4, released in 2013. All technologies in question have improved much since then, especially graph db technology, efficiency, and speed, so I don't think that paper has as much relevance anymore. Would lo
9.
▲
by
AndrewBowman
7y ago
Deletes do have an extra cost as relationships do need to be deleted first, and there are some batching approaches for handling this case. For graph databases there's not much choice on this unless you want to deal with dangling relati
10.
▲
by
AndrewBowman
7y ago
In Neo4j at least the node ids are offsets into the node and relationship stores, so you are literally pointer hopping through the store files from node structure to relationship structure to node structure. No need for a hash table or b-tr
11.
▲
by
AndrewBowman
7y ago
There is a older, but seemingly relevant, question/answer for this on stack overflow: https://stackoverflow.com/a/5611541/92359 > if you shrink a table, or update a partitioned table (causing a row to move
12.
▲
by
AndrewBowman
7y ago
Note that this is an old paper. They are using Neo4j 1.8.2 for this (and the community version at that), which was released in February of 2013. Neo4j is at 3.5.9 currently, with 4.0 on the horizon, so there have been 2 major releases, near
13.
▲
by
AndrewBowman
7y ago
There are of course certain structures you can use to ease the selection of the relationships you want to follow, and Neo4j does use some of its own, breaking down relationships on a node first by type, and then by incoming or outgoing, all