ous items in
>>> the
>>> path.
>>> Finding the path requires a traversal from the first Class node in the
>>> path, following the given relationships. This traversal can potentially be
>>> expensive when a class takes many instances (all have a relationshi
gt;> relationship making up the path a property encoding the path, then use the
>> index to retrieve all relationships making up the path and lay those
>> relationships head to toe to construct the path. No longer would a
>> traversal
>> be necessary and the cost of the
ne of the
> elements in the path can potentially have.
> Niels
>
> From: tobias.ivars...@neotechnology.com
> > Date: Sat, 15 May 2010 13:32:36 +0200
> > To: user@lists.neo4j.org
> > Subject: Re: [Neo] Indexing Relationships?
> >
> > There is no indexing comp
ally have.
Niels
From: tobias.ivars...@neotechnology.com
> Date: Sat, 15 May 2010 13:32:36 +0200
> To: user@lists.neo4j.org
> Subject: Re: [Neo] Indexing Relationships?
>
> There is no indexing component for Relationships and there has never been
> one.
> The interesting question
as.ivars...@neotechnology.com
> Date: Sat, 15 May 2010 13:32:36 +0200
> To: user@lists.neo4j.org
> Subject: Re: [Neo] Indexing Relationships?
>
> There is no indexing component for Relationships and there has never been
> one.
> The interesting question that you should have asked i
Tobias,
On 5/15/2010 7:32 AM, Tobias Ivarsson wrote:
> There is no indexing component for Relationships and there has never been
> one.
> The interesting question that you should have asked is: _will_ there ever be
> one.
>
> The answer to that question is: maybe, it has been prototyped as part of
There is no indexing component for Relationships and there has never been
one.
The interesting question that you should have asked is: _will_ there ever be
one.
The answer to that question is: maybe, it has been prototyped as part of a
simplification of the entire indexing API.
The interesting th
Hi all,
I am working on an application that stores large network data from multiple
domains in Neo4j databases. The object is to allow users to upload network
datasets and then expose them to researchers over the web, allowing
researchers to subset the data and eventually download their own subgra
>> My problem is the following:
>> I have a bi-partite graph consisting of two kinds of entities (say Users
>> and Images). A User object can be related to Images by means of
>> USER_IMAGE relationships.
>> Following the design guidelines, I have mapped this scheme to Neo4j in
>> the following way
On Tue, Jul 7, 2009 at 5:15 PM, Symeon (Akis)
Papadopoulos wrote:
> Johan Svensson wrote:
>
>> What we keep forgetting is that the graph already is the index. A well
>> designed graph will often check if a specific relationship exist
>> between two nodes just as fast as asking an already existing g
Johan Svensson wrote:
> Hello,
>
> We have discussed this and given it some thought before. I think
> having a global index on (node1,node2,relationship) will not work
> well. Just managing that index will slow down relationship create and
> delete a lot.
>
I agree. That's why, as Tobias noted i
Hello,
We have discussed this and given it some thought before. I think
having a global index on (node1,node2,relationship) will not work
well. Just managing that index will slow down relationship create and
delete a lot.
What we keep forgetting is that the graph already is the index. A well
desi
On Tue, Jul 7, 2009 at 10:12 AM, Symeon (Akis) Papadopoulos
wrote:
> Perhaps the lookup method should have an additional argument specifying
> whether the relationship is directed or not.
Good point, but I think it's better to add a specific method for that kind
of lookup:
interface Relationshi
2009/7/7 Symeon (Akis) Papadopoulos :
>
>> Was that what you meant?
>>
>> My interpretation of Symeons request was an index from
>> (RelationshipType,Node,Node) to Relationship, which in my opinion would be
>> much more useful than a simple index from (String,primitive) to
>> Relationship, which is
> Was that what you meant?
>
> My interpretation of Symeons request was an index from
> (RelationshipType,Node,Node) to Relationship, which in my opinion would be
> much more useful than a simple index from (String,primitive) to
> Relationship, which is how the node indexes work.
>
That was exa
Was that what you meant?
My interpretation of Symeons request was an index from
(RelationshipType,Node,Node) to Relationship, which in my opinion would be
much more useful than a simple index from (String,primitive) to
Relationship, which is how the node indexes work.
The use for such an index wo
Hi Symeon,
so, what you are saying is that you would like to have the possibility
to set indexes on relationships and their properties just like on the
nodes as in http://components.neo4j.org/index-util/ ?
I guess that would be easy to do, or you could do it yourself by
looking at the index-util p
Hi,
I have been experimenting with incremental building of large graphs and
I realized that the graph update process would be much faster if there
was a possibility to index relationships between pairs of nodes in order
to have the possibility for quick lookups. Currently, each time I want
to
Hi!
As the relationships are a core strength of neo4j, this would be a nice
addition to the index API.
In the current IMDB example data model the roles are modeled as
relationships and at the moment not searchable (which they really should
be). So I have a use case for this!
There are workaro
Hi Anders,
When we specified the IndexService API getRelationshipById was not
present in the Neo core API. That has changed now so maybe we will
extend the index API to support this.
-Johan
On Thu, Aug 7, 2008 at 7:44 PM, Anders Nawroth <[EMAIL PROTECTED]> wrote:
> Hi!
>
> Any way I can index re
Hi!
Any way I can index relationships?
Can't find this in the IndexService API.
Would be useful, as information can be stored as relationship properties.
/anders
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
21 matches
Mail list logo
