Dear all,
we have the following situation:
- 1 client is writing to the embedded db (writer)
- 1 client would like to watch that (read-only)
is that possible with the EmbeddedReadOnlyGraphDatabase?
Currently it seems that the read-only db does not see the updates from
the writer since its
Hi Alfredas,
One sensible thing you could do in this situation is run in HA mode. That way
you route requests to one node, and route reads to the other.
If you route writes to the master, the read slave is eventually consistent.
If you route writes to the slave, it is immediately consistent.
2011/4/5 Jim Webber j...@neotechnology.com
Hi Alfredas,
One sensible thing you could do in this situation is run in HA mode. That
way you route requests to one node, and route reads to the other.
If you route writes to the master, the read slave is eventually consistent.
If you route
Awh snap.
I think next up on the Beerlin track is a release party for Neo4j 1.3
which we are fighting to get out :)
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter
Sure, we can make something in town about it!! tell me!!
/purbon
2011/4/5 Peter Neubauer peter.neuba...@neotechnology.com
Awh snap.
I think next up on the Beerlin track is a release party for Neo4j 1.3
which we are fighting to get out :)
Cheers,
/peter neubauer
GTalk:
Alfredas,
When you say watch, do you mean poll the graph at some interval? What
would the read-only client do?
Thanks,
David
On Tue, Apr 5, 2011 at 5:26 AM, Alfredas Chmieliauskas
al.fre...@gmail.comwrote:
Dear all,
we have the following situation:
- 1 client is writing to the embedded db
Yes. The read only client would query the db at time intervals.
Alfredas
On Tue, Apr 5, 2011 at 5:40 PM, David Montag
david.mon...@neotechnology.com wrote:
Alfredas,
When you say watch, do you mean poll the graph at some interval? What
would the read-only client do?
Thanks,
David
On Tue,
Well so lastRelationship() isnt the right one method I am looking for
and I have to look for highest id manually.
But I have problem that if I traverse in the way like Michael suggested:
IteratorNode i =
Traversal.description().relationships(RelationshipTypes.TICKET_QUEUE,
Alfredas,
A solution based on EmbeddedReadOnlyGraphDatabase would not be able to
benefit from caching, as each refresh of the view would have to clear the
caches. You could possibly achieve the solution you want by setting the
config parameter cache_type=none for the read-only instance. Then it
Hello everyone.
Was this issue investigated and, perhaps, solved ?
We started experiencing the same today, on Neo 1.1 on CentOS 5 and couldn't
manage to reproduce it reliably yet.
I will attach a stacktrace and more info tomorrow, but wanted to know if there
were any news on the issue.
Thanks
Hi,
we're approaching the first public final release of Spring Data Graph in big
steps.
Thanks to the feedback we were able to improve it further.
Special Thanks to Alfredas who used SDG in his impressive Energy Market
Simulation and gave us valueable insights.
The major things in this
Hi Francesco,
Is there a compelling reason why you need to be on Neo 1.1? We're in the
process of releasing 1.3 which has substantial advantages over 1.1 (larger
databases, performance improvements, bug fixes).
Could you run a quick experiment on one of the 1.3 milestone builds and perhaps
Hi Jim.
Actually there is more than one.
The code is already in production, so we are not eager to move too early on new
versions.
Moreover, we have very small databases and performance is not an issue, so the
_only_ driver for upgrade would be the fixing of specific (this :-) ) bugs.
We've
13 matches
Mail list logo
