Hi,
I am new to graph databases. I and my friends decided to make simple social
network and i am researching about graph databases and other nosql databases. I
like the idea of graph db and i want to use them but i have questions. My
question is if i decided to use graph database am i need
Hi Fatih
Yes, a graph database can be a complete replacement, holding your user's
login data, profiles, pictures, etc. If you're using JRuby, there's a gem
that interacts with the excellent devise authentication system.
For photos and certain other media, it probably makes more sense to store
Dear all,
could somebody point me to more documentation on the new traversal
framework (besides http://wiki.neo4j.org/content/Traversal_Framework)?
Also the new Evaluator and how to use it?
If we have a graph described in the pipes Co-Developers example
Hi Stephen
I am seriously considering to build my application on graph database but i
read about facebook, digg and linkedin use Key/value database. Why dont they
use graph database? What is the differences between Key/Value and graph
databases.
And i am using .Net Framework 4.0 for my
On Sun, Feb 20, 2011 at 10:48 AM, Alfredas Chmieliauskas
al.fre...@gmail.com wrote:
Dear all,
could somebody point me to more documentation on the new traversal
framework (besides http://wiki.neo4j.org/content/Traversal_Framework)?
Also the new Evaluator and how to use it?
That page,
Thanks.
On Sun, Feb 20, 2011 at 2:24 PM, Tobias Ivarsson
tobias.ivars...@neotechnology.com wrote:
On Sun, Feb 20, 2011 at 10:48 AM, Alfredas Chmieliauskas
al.fre...@gmail.com wrote:
Dear all,
could somebody point me to more documentation on the new traversal
framework (besides
Dear all,
I'm trying to combine spring data with tinkerpop pipes.
This is the way I'm trying to get a Blueprints graph from a
GraphDatabaseService injected by spring.
Graph graph = new
Neo4jGraph(this.getGraphDatabaseContext().getGraphDatabaseService());
But this gives me an exception:
Hi,
Traversal.description()
.depthFirst()
.relationships(RelationshipTypes.CREATED, Direction.BOTH)
.traverse(developer).nodes()
To be clear, a co-creator is someone is who has created the same things as you
and who is not you. Thus, you need to go outgoing CREATED, then incoming
CREATED,
On Sun, Feb 20, 2011 at 6:11 PM, Brendan ccp...@gmail.com wrote:
Hi,
After I install the neo4j on ubuntu server I'm able to backup the full
database, even repeatedly but it crashed on incremental.
Could you please provide a stacktrace, and other kinds of error output from
this crash.
Thank
Hi,
But this gives me an exception:
Exception in thread main java.lang.NullPointerException
at
com.tinkerpop.blueprints.pgm.impls.neo4j.Neo4jGraph.loadIndices(Neo4jGraph.java:76)
at
com.tinkerpop.blueprints.pgm.impls.neo4j.Neo4jGraph.init(Neo4jGraph.java:69)
Everything
On Sun, Feb 20, 2011 at 7:04 PM, Marko Rodriguez okramma...@gmail.comwrote:
Hi,
Traversal.description()
.depthFirst()
.relationships(RelationshipTypes.CREATED, Direction.BOTH)
.traverse(developer).nodes()
To be clear, a co-creator is someone is who has created the same things as
you
Hi,
Just to be picky:
The easiest way to do that in this case is by adding:
.uniqueness(Uniqueness.NODE_PATH)
A co-creator's co-creator can be you. Thus, marko's co-creator's co-creator is
marko (amongst other people). In this case, unique on a path would not fail,
no? Can you do something
Updated to 0.5-SNAPSHOT. Works. Great!
On a more abstract topic - I'm wondering it there's a good way to use
your domain objects in Pipes instead of vertices and edges?
So far I've just created a new PipeVertex, T that converts the
vertices to your domain object by referring to node id.
What
Marko, I don't understand what you are trying to say.
Is the question about finding, given a person node, the co-creators for that
person on any project? Or is it about reasoning in the abstract co-creator
graph. I was under the impression that finding co-creators was the only
thing we were
Hi,
Updated to 0.5-SNAPSHOT. Works. Great!
Excellent. (Again: note that IndexableGraph and AutomaticIndex are slightly
different in 0.5 than 0.4).
On a more abstract topic - I'm wondering it there's a good way to use
your domain objects in Pipes instead of vertices and edges?
So far I've
On Sun, Feb 20, 2011 at 7:43 PM, Marko Rodriguez okramma...@gmail.com wrote:
Hi,
Updated to 0.5-SNAPSHOT. Works. Great!
Excellent. (Again: note that IndexableGraph and AutomaticIndex are slightly
different in 0.5 than 0.4).
On a more abstract topic - I'm wondering it there's a good way
Hey,
Thats exactly what I did.
class MappingPipe extends AbstractPipeVertex, T implements PipeVertex, T {
@Override
protected T processNextStart() throws NoSuchElementException {
Vertex v = this.starts.next();
return findById((Long) v.getId());
all finders map back to the underlying graph so it doesnt matter which one to
use.
one could still add a toVertex wrapper to your domain objects to have them be
usable in tinkerpop
what is the usecase you want to achieve with the combination of spring data
graph and tinkerpop
glad that
Hi there,
I think something like returning all but the start node would do the
trick in this special, see
http://api.neo4j.org/1.2/org/neo4j/graphdb/ReturnableEvaluator.html#ALL_BUT_START_NODE
or similar.
More generally, if you want to see the history of things, you can
examine the provided PATH
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
On Sun, Feb 20, 2011 at 8:20 PM, Michael Hunger
michael.hun...@neotechnology.com wrote:
all finders map back to the underlying graph so it doesnt matter which one to
use.
one could still add a toVertex wrapper to your domain objects to have them be
usable in tinkerpop
what is the usecase
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
Alfredas,
very interesting ideas. I think that kind of repository would have to be built
in your application, _but_ we should provide the building blocks so that you
can easily put it together.
I'm thinking about providing support for Repositories in the Hades/Spring JPA
style where you get a
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
michael.hun...@neotechnology.com wrote:
One purpose of the reference not is that you don't have to rely on indexing
On Fri, Feb 18, 2011 at 12:42, francoisk6 francois_...@hotmail.com wrote:
[...] is there an example to use fulltext search
On Saturday, 19 February 2011 at 6:08 AM, Maximilian Schulz wrote:
Hi Francois,
[...] I will write a brief post about it and add the source code as
well. I could do it
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
While I like what I have seen so far of neo4j and plan to make use of it, I
still have questions regarding its scalability credentials.
At the moment I'm using riak and cassandra because they bring different
things to the table but I know I can easily expand just by adding extra an
extra box as I
Hi JT,
The default way of scaling Neo4j is to use the an HA cluster and route requests
(via some domain-specific strategy) to specific instances to ensure that
caches stay warm (that is cache sharding).
So scaling for Neo4j is a function of having enough RAM to comfortably hold the
working
Ok cool, I look forward to reading it :)
One thing, when you say route requests to specific instances .. does that
imply that node relationships can't span instances ?
e.g. say if node 1 and was connected (at depth 1 or deeper) to a node that
was stored in another instance would the neo4j
Hello JT,
One thing, when you say route requests to specific instances .. does that
imply that node relationships can't span instances ?
Yes that's right. What I'm suggesting here is that each instance is a full
replica that works on a subset of requests which are likely to keep the caches
Tobias,
Here s the stack trace and part of the wrapper.log:
run:
Mon Feb 21 10:28:59 CST 2011: Client connected to 192.168.1.101:6362
Mon Feb 21 10:29:00 CST 2011: Opened a new channel to /192.168.1.101:6362
21-Feb-2011 10:29:20 itags.Sync.SyncData main
SEVERE: null
org.neo4j.com.ComException:
Thanks all for your help. I forgot to post my performance results like i was
asked :) so here are some typical examples of them. I've run many tests,
with different overlaying architectures, and different amounts of data on
each node/edge, these are the performance stats for the latest build.
Hi guys,
I'm trying to use a LuceneFulltextIndexBatchInserter to index all my data as
I import it, so I can search on properties other than just an ID, but it
fairly quickly (~5 seconds) comes back with an
org.apache.lucene.store.LockObtainFailedException: Lock obtain timed out:
Guys,
So I ran into the Ask Ken project ( http://askken.heroku.com/ ) by
Michael Aufreiter yesterdat, and though it was pretty awesome... so I
ported it to using Neo4j.
Check it out: http://neovigator.heroku.com/
On github at https://github.com/maxdemarzi/neovigator
Regards,
Max
Thx Max, I’ll appreciate if you provide the post link, it would be nice.
-
Regards,
Francois Kassis.
--
View this message in context:
http://neo4j-user-list.438527.n3.nabble.com/Neo4j-rest-server-indexing-tp2526084p2543028.html
Sent from the Neo4J User List mailing list archive at
Matthieu Ardon
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Nice stuff!
On Mon, Feb 21, 2011 at 6:18 AM, Max De Marzi Jr. maxdema...@gmail.comwrote:
Guys,
So I ran into the Ask Ken project ( http://askken.heroku.com/ ) by
Michael Aufreiter yesterdat, and though it was pretty awesome... so I
ported it to using Neo4j.
Check it out:
Hi!
I'm just sorting out packaging issues at the moment, an updated
Neoclipse version should be out within a few days. Sorry for the
inconvenience.
/anders
On 02/18/2011 06:13 PM, Nat Pryce wrote:
One comment: the page recommends using Neoclipse to examine the graph
after test failures but
38 matches
Mail list logo
