Hi Atle!
2010-09-07 22:43, Atle Osmoen-Prange:
> Is there a way to get a hold of the transaction context, and pass it around,
> instead of having it bound to a thread.
>
> The case is that i want to use actors for multithreading, and the
> transaction might leave the thread it was started in.
You
Is there a way to get a hold of the transaction context, and pass it around,
instead of having it bound to a thread.
The case is that i want to use actors for multithreading, and the
transaction might leave the thread it was started in.
-atle
___
Neo4j
Andreas Kollegger wrote:
> Oh, and here's the graph...
>
>
>
> On Tue, Sep 7, 2010 at 10:59 AM, Andreas Kollegger <
> andreas.kolleg...@neotechnology.com> wrote:
>
>
>> Hey Stephane,
>>
>> It occurs to me that a general strategy for improving traversal speeds is
>> to add indexing nodes that hel
Hmmm, I'll check out the paper, but I think the problem with any
shared memory is to maintain consistency you have to synchronize and
that will drastically reduce scale.
I think eventually consistent, share nothing graph stores with
merging/replication (master/master) is the way to go.
Ilya
On T
Hi Francois,
Comments below.
On Tue, Sep 7, 2010 at 2:10 PM, Francois Kassis wrote:
> Hi all,
>
> 1) How could I import data from a hierarchical csv data file into
> neo4j.py using python.
>
It depends a little on what your data looks like. Care to share a few lines?
It would make it much
Hi all,
1) How could I import data from a hierarchical csv data file into neo4j.py
using python.
2) How to retrieve a node by one of it's propreties.
THX
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listi
The paper looks interesting, but could you perhaps give me an outline of the
differences between distributed key-value stores (like www.hazelcast.com),
and distributed shared memory?
-atle
On Tue, Sep 7, 2010 at 12:01 PM, Jim Webber wrote:
> Hi Atle,
>
> I'm thinking along different lines: som
Hi Atle,
I'm thinking along different lines: something like distributed shared memory
with caching (and performant cache invalidation). My old friend Savas
Parastatidis implemented such a scheme around 10 years ago for his PhD, and I'm
starting to think whether it'd be an appropriate approach f
Hey Stephane,
It occurs to me that a general strategy for improving traversal speeds is to
add indexing nodes that help reduce the number of possible paths to check.
For instance, you could add "week of the year" nodes which group bank
receipts and statements into a time-oriented groups. In the at
Hi, i have been thinking about this for a while, but i am not very smart, so
the results aren't that interesting.
One way to solve this is just to model the graph ontop of a key-value store,
and store pointers to nodes and relationships in the values. The pro is that
its easy to implement, and it
2010/9/6 Alexandru Popescu ☀
> On Monday, September 6, 2010, Jim Webber wrote:
> > Hi Alex,
> >
> >> While I still can achieve all these with the current packaging, it
> >> feels more "hacky": I need to create a new Jetty6BasedWebServer or
> >> modify the existing one to enhance it with my own s
Hi again,
Sorry for the inadvertent vowel switch on your name, a problem I experience
far too often in the US when mailing lists decide to drop the last letter of
my name.
Cheers,
Andrea
On Tue, Sep 7, 2010 at 7:27 AM, Andreas Kollegger <
andreas.kolleg...@neotechnology.com> wrote:
> Hi Alexand
12 matches
Mail list logo