Hi!
Thanks for the input, I'll look into doing it in the returnable evaluator.
Good points :-)
/anders
Johan Svensson skrev:
Hi,
You could implement your own returnable evaluator only to return best
match or complete match nodes. If not I would pick the nested loop
one since code is
Hi,
You could implement your own returnable evaluator only to return best
match or complete match nodes. If not I would pick the nested loop
one since code is cleaner or write a combination of traverser + for
loop in one of the evaluators.
-Johan
On Sat, Aug 9, 2008 at 2:28 PM, Anders Nawroth
hi!
Johan Svensson wrote:
anders.nawroth wrote:
As I'm currently looking into the IMDB Workshop stuff, it would be helpful
to hear your idea on a graph layout to make searches for actor names and
movie titles in a better way then just using indexing! There's a need for
supporting partial
On Fri, Aug 8, 2008 at 12:34 PM, Anders Nawroth
[EMAIL PROTECTED] wrote:
hi!
Johan Svensson wrote:
anders.nawroth wrote:
As I'm currently looking into the IMDB Workshop stuff, it would be helpful
to hear your idea on a graph layout to make searches for actor names and
movie titles in a
Hi Anders,
On Tue, Jul 29, 2008 at 5:06 PM, Anders Nawroth
[EMAIL PROTECTED] wrote:
hi Johan!
Johan Svensson wrote:
As you say IndexService is very simple and only supports exact lookup
at the moment. Use the index service to position yourself somewhere in
the graph (or if you can get away
Hi Andreas,
As you say IndexService is very simple and only supports exact lookup
at the moment. Use the index service to position yourself somewhere in
the graph (or if you can get away with using Neo's native ids since
getNodeById is lightning fast) . Once you have a position you start
hi Johan!
Johan Svensson wrote:
As you say IndexService is very simple and only supports exact lookup
at the moment. Use the index service to position yourself somewhere in
the graph (or if you can get away with using Neo's native ids since
getNodeById is lightning fast) . Once you have a
7 matches
Mail list logo