I would like to set AND as the default operator when I create index using the
new index library:
Index = indexProvider.nodeIndex( fulltext,
LuceneIndexProvider.FULLTEXT_CONFIG );
I didn't find setDefaultOperator (similar to the one
in LuceneFulltextQueryIndexService )in any of the provider
2010/9/10, Honnur Vorvoi vhon...@yahoo.com:
I would like to set AND as the default operator when I create index using
the new index library:
Index = indexProvider.nodeIndex( fulltext,
LuceneIndexProvider.FULLTEXT_CONFIG );
I didn't find setDefaultOperator (similar to the one
in
I got cali's benchmark result. Well, sort of benchmarks:
http://github.com/dmitriid/cali/wiki/Benchmarks-of-sorts There's neo4j,
TinkerGraph and OrientDB
For some odd reason neo4j performs abysmally, though yesterday it was way, way
better: http://twitter.com/dmitriid/status/23912123904
Will
Yeah, I guess that could be a problem (or the problem).
Hmmm... I'll try and run the benchmark on a less busier machine and see what
happens then.
Thanks for the tip!
FWIW, I've noticed that neo4j seems to be fairly sensitive to disk I/O
performance.
I couldn't get it to work at all on
Hi Dimitri,
Also, Blueprints assumes auto transactions (that is, every delete/write is a
committed transaction). You can turn that feature off if you want better
write/delete performance.
One of my next big goals with Blueprints is a general-purpose transaction model
so that all
Hi just a quick question regarding the use of the PruneEvaluator
I was wondering what would be the best way to modify the
TraversalDescription in the Dijkstra
algorithm in order to prune a traversal when a branch has reached a second
transfer relationship.
I want to avoid multiple transfers in a
Hi Paddy,
One idea is to prune the traversal by looking at whether the path so far
already has a transfer relationship or not. You would then do some kind of
filtering of the resulting paths, e.g. only accepting those with correct end
nodes. I don't know if the computational complexity of this is
7 matches
Mail list logo