oeps .. typo.. i mean ("likes" must have been "knows")
(a)-[:KNOWS]->(knows)-[:KNOWS]->(b)
Op zaterdag 29 maart 2014 07:41:36 UTC+1 schreef [:Koen]:
>
> Hi, i am considering how to capture the "date/time" dimension efficiently
> in a graph. The bigger idea being able to query on the exact s
Hi, i am considering how to capture the "date/time" dimension efficiently
in a graph. The bigger idea being able to query on the exact status of my
graph in any point in time (history) .. this includes when nodes are
created , modified and also when relations are created and modified
Since i
Is there a way to access neo4j through web browser and Java code
simultaneously? I only need to read the DB through Web Browser.
Regards
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails from it,
Thank you for the reply Michael. Yes, and I already tried it again for a
second time.
I just realized that was my mistake. I always thought that the new feature
Labels already applied Index or Constraint so I had never created Index or
Constraint when I was using cypher.
And after I created con
Thank you for the reply Ludnin.
And I already tried MATCH (n:User)-[:Friend*3]-(FoFoF) return FoFoF; and
the result is still the same that is about 85000ms.
I just realized that was my mistake. I always thought that the new feature
Labels already applied Index or Constraint so I had never created
You should create an index for your label/property combo.
Something like:
try ( Transaction tx = graphdb.beginTx() )
{
graphdb.schema()
.indexFor( DynamicLabel.label( "MyLabel" ) )
.on( "myProperty" )
.create();
tx.success();
}
Wes
On Fri, Mar 28, 201
Michael, what would a ballpark figure look like in man hours in order to
move sdn to cypher? Maybe we can crowdsource it. :)
On Fri, Mar 28, 2014 at 2:49 AM, Michael Hunger <
michael.hun...@neopersistence.com> wrote:
> Sadly neither
>
> It uses core java api methods to do it
>
> No time to rewr
A few years ago I had a very interesting chat with Danial Kastl, one of the
leads of http://pgrouting.org/, the well known routing library for PostGIS.
He described to me various ideas for how to route on a graph, and how to
deal with turning restrictions. I don't remember all the details, but I ca
findNodesByLabelAndProperty searches a whole graph. At this point is not
important because mine is tiny.
But as it grows this function becomes slower. I can pinpoint the root node
from which all the nodes that match the function's criteria. So the
question is:
is there a way to feed findNod
A few examples located at:
http://docs.neo4j.org/chunked/milestone/rest-api-transactional.html
I recommend sending 100 at a time to start, and play with less or
more--depending on latency and query structure you can get better results
either way.
Wes
On Fri, Mar 28, 2014 at 3:56 PM, Alex Frieden
Hi all,
Currently I am using HttpBuilder and sending post requests to an open
transaction. Per file, I am sending about 200,000 requests to the endpoint
which is a lot. I would like to batch together the query and corresponding
parameter map into each post request. However, I don't see any e
Hi,
Starting from OSM data file, i already create nodes and edges in neo4j
graph and i can correctly calculate the shortest path with Dijkstra
algorithm.
Then, i created a restriction's list, where each is identified by fromRel,
viaNode, toRel.
Now i would like to manage this information (restri
Hi,
Starting from OSM data file, i already create nodes and edges in neo4j
graph and i can correctly calculate the shortest path with Dijkstra
algorithm.
Then, i created a restriction's list, where each is identified by fromRel,
viaNode, toRel.
Now i would like to manage this information (restri
Hi All,
Are there any graph datasets out there which can be used to benchmark
various graph algorithms ??
Akhil
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to neo4j
Hi Akhil,
Good question! Neo Technology is actually involved in an EU-funded research
project that is tasked with developing industry supported performance
benchmarks for graph database and graph processing systems. The project is
called the Linked Data Benchmark Council (LDBC). If you want to read
Rio,
was this your first run of both statements? If so, please run them for a
second time.
And did you create an index or constraint for :User(user_id) ?
MATCH (U:User) RETURN COUNT(U);
I would also change:
MATCH (U:User)-[F:Friend]->(FU:User)-[FF:Friend]->(FFU:User)
WHERE U.user_id=1 AND FFU.u
ms, it is milliseconds.
What is the corresponding result for a SQL db ?
MATCH (n:User)-[:Friend*3]-(FoFoF) return FoFoF;
Albeit a valid search is it something useful ? I would think finding a
specific persons FoFoF in either end, as a starting point or end point,
would be a very realistic scena
Hi again,
Any ideas or input to simplify the problem? Would be possible to halt the
traverseal until a specific threshold has been reached ?
I haven't tried all possible functions, maybe something with a FOREACH and
then a CASE scenario would evaluate each traversal and return the result
upon
Good to know.
Thanks.
On Fri, Mar 28, 2014 at 2:37 AM, Michael Hunger <
michael.hun...@neotechnology.com> wrote:
> Because it was only added to the tx-endpoint which has a condensed format
> to allow some other formats too.
>
> The existing cypher endpoint won't be maintained in the long term a
Hi Peter,
Thank you for giving a try looking at it.
This is the test code:
static void TestNeo4j(int MaxDegreeOfParallelism)
{
Teva.Common.Data.Neo4j Client = new
Common.Data.Neo4j("127.0.0.1", "7474");
System.Diagnostics.Stopwatch Stopwatch = new
System.Diagnos
Also,
Are there any plans for Neo4j to be in the next Tinkerpop version?
All of my usage is based on using Gremlin over REST, and I have to know I'm
counting on a product/solution that's gonna be there in the next few years.
Regards,
Effy
On Friday, March 28, 2014 12:32:17 PM UTC+3, Peter Neuba
Effy,
as Neo4j 2.0.1 is not in any official Tinkerpop version yet, we haven't
spent a hug amount on performance testing the plugin. However, do you have
that test somewhere so I can have a look?
/peter
G: neubauer.peter
S: peter.neubauer
P: +46 704 106975
L: http://www.linkedin.com/in/neuba
Sure Michael i will create JIRA issue for this.
Thank you
On Fri, Mar 28, 2014 at 1:00 PM, Michael Hunger <
michael.hun...@neotechnology.com> wrote:
> I think I don't have something like that. But would be good to have, true.
> Perhaps you can issue a JIRA issue about that, so that we don't fo
1. yes the files are updated
2. in the sample directory is a different batch.properties which is used
and if you look into it you'll see that the Users index is configured there
3. You have to stop the server, copy the created database into your server
directory: * cp -r target/graph.db/* /usr/loca
I think I don't have something like that. But would be good to have, true.
Perhaps you can issue a JIRA issue about that, so that we don't forget.
Otherwise if you really need it quickly, you can give it a try, get it
started and share the github project. Then I can help you fix issues and
you can
Hi folks..
I am quite newbie to neo4j. I am using neo4j-community 1.9.4 version.
I am working in centos(single machine).
I have some questions related to neo4j data/graph.db directory. This
directory contains various files related to node store,property store,
relationship store.
If we cre
26 matches
Mail list logo
