2011/2/20 Michael Hunger
> Yep. Just think in graph index :)
>
> To clarify: in-graph index, the "natural" index that is the graph itself.
>
> Michael
>
> Am 20.02.2011 um 22:26 schrieb Mark Nijhof:
>
> > Ah right, so I could connect via a relationship my type nodes to this
> > reference node (a
Yep. Just think in graph index :)
Michael
Am 20.02.2011 um 22:26 schrieb Mark Nijhof:
> Ah right, so I could connect via a relationship my type nodes to this
> reference node (atm I was using an index to get to them).
>
> -Mark
>
>
>
> On 20. feb. 2011, at 22:24, Michael Hunger
> wrote:
>
Ah right, so I could connect via a relationship my type nodes to this
reference node (atm I was using an index to get to them).
-Mark
On 20. feb. 2011, at 22:24, Michael Hunger
wrote:
> One purpose of the reference not is that you don't have to rely on indexing
> for getting to certain nodes
One purpose of the reference not is that you don't have to rely on indexing for
getting to certain nodes.
If you connect your nodes to the reference node in a way that puts them in
certain categories you can always get to them via traversal.
Connections to the reference node are also used for v
Hi,
Silly question perhaps, but what is the purpose of the root node? Why would
I want to get it?
-Mark
--
Mark Nijhof
m: 0047 95 00 99 37
e: mark.nij...@cre8ivethought.com
b: cre8ivethought.com/blog/index
"Walking on water and developing software from a specification are easy if
both are
5 matches
Mail list logo