version 3.5.
Yes, I saw the mod for this.
On Wednesday, 2 January 2019 19:55:03 UTC, Mattias Finné wrote:
>
> Unfortunately the exception message doesn't include vital information
> about node and value. This has recently been added and will be available in
> an upcoming release. Which
Solved my problem - use the magic of Apoc:
call apoc.meta.stats yield relTypes;
Thanks Max !
Wayne.
On Monday, 4 September 2017 18:28:29 UTC+1, unreal...@googlemail.com wrote:
> Return all unique edges:
>
> neo4j> START r=rel(*) return distinct type(r);
>
> I have a DB with billions of edges.
Return all unique edges:
neo4j> START r=rel(*) return distinct type(r);
I have a DB with billions of edges. Is there a quicker way to do this ?
Hint: In the browser, relationship types -> show all appears to return all
the values quickly.
What is it doing that I'm not ?
Wayne
--
You
Patrice,
I started off with a VM configuration similar to yourself. I found a
considerable speed up by ditching the VM and running native on the Linux
platform.
Wayne
On Friday, 30 June 2017 21:43:12 UTC+1, Patrice Loos wrote:
> I am testing a java query on different size dataset, 100
Before queries, I try and warm things up before performing any timings:
neo4j> call apoc.warmup.run() ;
and
neo4j> match (n:Entity) with n.name as name return count(*);
Michael,how much faster in real terms then is neo4j 3.2.1 over 3.2.0
Enterprise and for which operations?
On
I have been wondering for a while whether this was possible in Neo4j.
Are we likely to see this functionality in main stream Neo4j (requiring no
mods) ?
Could this be extended to other 'objects' such as sound and video ?
Wayne
On Sunday, 28 May 2017 14:46:04 UTC+1, Michael Hunger wrote:
>
>
int on :Entity(name)
>
> Merge does match-or-create
>
> So it tries to find first and otherwise create
>
> Von meinem iPhone gesendet
>
> Am 26.05.2017 um 12:16 schrieb unrealadmin23 via Neo4j <
> ne...@googlegroups.com >:
>
> John, Michael,
>
> Thank you fo
John, Michael,
Thank you for your suggestions.
Interestingly I found my problem. Consider these 2 examples:
neo4j> MERGE (node_c:Entity { name:'spumante cricova' }) MERGE
(node_a:Entity { name:'romainian' }) WITH node_a, node_c CREATE UNIQUE
(node_a)-[:language]->(node_c);
0 rows available
f)
>
> and start has been deprecated for a long while.
>
> Cheers, Michael
>
> > Am 12.05.2017 um 16:10 schrieb unrealadmin23 via Neo4j <
> ne...@googlegroups.com >:
> >
> > Interestingly, other queries appear to run just fine, but there appear
Interestingly, other queries appear to run just fine, but there appears to
be a problem with any query using the 'Start' directive...
On Friday, 12 May 2017 14:58:10 UTC+1, unreal...@googlemail.com wrote:
>
>
> Hi,
>
> Noticing that the latest Neo4j Enterprise release was available today, I
Hi,
Noticing that the latest Neo4j Enterprise release was available today, I
downloaded it and gave it a try.
On trying to start the DB I noticed that there was a message saying that I
need to set dbms.allow_format_migration=true
Following setting this parameter, the DB started with no
;
> match (n:Entity)-[*4]-(p) where p.name contains "..."
>
> Add a label to p, add an index to :Label(name)
>
> Then it should perform better,
> What do you do with the results from that pattern match ?
>
> How many do you return?
>
> Michael
>
> O
:52:17 UTC+1, Michael Hunger wrote:
>>>
>>> There is some of that in apoc.cypher.mapParallel, but it's not as
>>> performant as it should be, I have to check again what keeps it back from
>>> performing.
>>>
>>> How many CPUs do you have on your system?
>>>
>
erformant as it should be, I have to check again what keeps it back from
> performing.
>
> How many CPUs do you have on your system?
>
> Cheers, Michael
>
>
> On Sat, Apr 1, 2017 at 10:53 AM, unrealadmin23 via Neo4j <
> ne...@googlegroups.com > wrote:
>
>> So is the
Consider a number of arbitrary nodes, A,B,C,D,E,F,.
I wish to return all of the shortest paths between these nodes.
The nodes may have many edges between them, but anticipate a maximum of 4.
The graph is complex and non hierarchical (if this makes sense - any node
may point to any other
So is there a generic way of parallel threading for searches ?
match (n:Entity)-[*4]-(p) where p.name contains "..." Takes a long
time on my system and uses 1 thread
If so, could this not be part of apoc or the like ?
On Friday, 31 March 2017 15:56:07 UTC+1, Max De Marzi Jr. wrote:
So I would like to see a benchmark that majors on the 'deep search'
performance of the various graph databases, which would draw upon:
1. Multi threading (for single searches mainly) but for other operations
also - limited by the capability of the graph DB
2. In memory enhancements.- limited
But I have only seen the message since using the apoc.cypher.runTimeboxed
call.
On Friday, 24 March 2017 12:49:10 UTC, Michael Hunger wrote:
>
> It's unrelated
>
> Von meinem iPhone gesendet
>
> Am 24.03.2017 um 13:18 schrieb unrealadmin23 via Neo4j <
> ne...@googl
ote:
>>>
>>> Hi,
>>>
>>> There is a procedure to do that in APOC, called
>>> `apoc.cypher.runTimeboxed`
>>> Check the documentation
>>> https://neo4j-contrib.github.io/neo4j-apoc-procedures/#_cypher_execution
>>>
>>> Che
er-shell
>
> Bye!
>
>
> On Wednesday, 22 March 2017 10:35:27 UTC, Benoît Simard wrote:
>>
>> Hi,
>>
>> There is a procedure to do that in APOC, called
>> `apoc.cypher.runTimeboxed`
>> Check the documentation
>> https://neo4j-contrib.github.io/neo4j-apoc-
> https://neo4j-contrib.github.io/neo4j-apoc-procedures/#_cypher_execution
>
> Cheers
>
> 2017-03-22 11:09 GMT+01:00 unrealadmin23 via Neo4j <ne...@googlegroups.com
> >:
> >
> > It would be good to be able to specify a maximum run time of a query - I
> >
It would be good to be able to specify a maximum run time of a query - I
know that you can set this as a global parameter but on a per query basis
would be very useful in some circumstances.
i.e.
match (). return a timeout=10;
Wayne
--
You received this message because you are
node or relationship-record access
>> should access them in-memory.
>>
>> Operations that require properties will still need to load them into the
>> page-cache and depending on the size setup displace existing entries.
>>
>>
>>
>> On Sun, Mar 12, 2017 at 4:45 PM,
t; All operations that now require only node or relationship-record access
> should access them in-memory.
>
> Operations that require properties will still need to load them into the
> page-cache and depending on the size setup displace existing entries.
>
>
>
> On Sun,
ote:
>
> There is not a kernel buffer, but own own page cache that you have to
> configure
>
> call apoc.warmup.run()
>
> Which warms up node and rel blocks
>
> Other speedup comes from jvm JIT warmup
>
>
> Von meinem iPhone gesendet
>
> Am 11.03.2017 um
Hi,
Assuming that I have enough memory to loaded the entire DB into it, are
there any options (optimisations) to allow for this or is it just a case of
the disk blocks being able to reside in the kernels buffer cache ?
Currently, the same query gets faster the more it is run - to a point. I
Following on from my previous performance related thread, complaining
about the lack of paralisation of matches.
Some matches should be very easy to parallize; i.,e.
neo4j> START r=rel(*) return distinct type(r) ;
Runs for about 24 hours on my system and consumes 1 thread. :-(
I have any
t;${NEO4J_BIN}/neo4j-shared.sh"
>>
>> main() {
>> setup_environment
>> check_java
>> build_classpath
>> export NEO4J_HOME NEO4J_CONF
>> exec "${JAVA_CMD}" -Xmx124G -Xms124G -cp "${CLASSPATH}"
>> -Dfile.encoding=UTF
coding=UTF-8 "org.neo4j.commandline.admin.AdminTool" "$@"
> }
>
> main "$@"
>
> I'll let you know in 24 hours.
>
> Wayne
>
> On Saturday, 4 March 2017 00:03:26 UTC, Michael Hunger wrote:
>>
>> Can you try to edit the script
AVA_CMD}" -Xmx124G -Xms124G -cp "${CLASSPATH}"
-Dfile.encoding=UTF-8 "org.neo4j.commandline.admin.AdminTool" "$@"
}
main "$@"
I'll let you know in 24 hours.
Wayne
On Saturday, 4 March 2017 00:03:26 UTC, Michael Hunger wrote:
>
> Can you try to edit the sc
ScoreQuery.createWeight(ConstantScoreQuery.java:119)
>> at
>> org.apache.lucene.search.IndexSearcher.createWeight(IndexSearcher.java:904)
>> at org.apache.lucene.search.BooleanWeight.(BooleanWeight.java:57)
>>
>>
>> I have also tried larger memory values.
>>
> On Mon, Feb 27, 2017 at 8:32 AM, unrealadmin23 via Neo4j <
> ne...@googlegroups.com > wrote:
>
>>
>> I should have said, that the head sizes are the ones that I have set in
>> neo4j.conf.
>>
>> Will these be used by check-consistency or do I need to supply t
oesn't
> make sense. Most people run with 32G as large heap.
>
> That said. I asked and currently the numbers from the config are not used,
> you have to do:
>
> export JAVA_OPTS=-Xmx24G -Xms24G
> neo4j-admin ...
>
>
> On Mon, Feb 27, 2017 at 8:32 AM, unrealadmin23 via Neo4
gt;
>> How much heap did you provide for it?
>>
>> Cheers, Michael
>>
>>
>> On Sun, Feb 26, 2017 at 8:28 PM, unrealadmin23 via Neo4j <
>> ne...@googlegroups.com> wrote:
>>
>>> The following o/p was obtained:
>>>
>>> .
>&g
you provide for it?
>
> Cheers, Michael
>
>
> On Sun, Feb 26, 2017 at 8:28 PM, unrealadmin23 via Neo4j <
> ne...@googlegroups.com > wrote:
>
>> The following o/p was obtained:
>>
>> .
>> .
>> .
>>
>> .
The following o/p was obtained:
.
.
.
90%
2017-02-26 00:03:16.883+ INFO [o.n.c.ConsistencyCheckService] ===
Stage7_RS_Backward ===
2017-02-26 00:03:16.885+ INFO [o.n.c.ConsistencyCheckService] I/Os
RelationshipStore
Reads: 3374851294
Random Reads: 2743390177
l show up in Neo4j as well some day.
>
> --
> Chris Vest
> System Engineer, Neo Technology
>
>
> > On 12 Feb 2017, at 09.36, unrealadmin23 via Neo4j <
> ne...@googlegroups.com > wrote:
> >
> >
> > Hi,
> >
> > I often run d
Thanks for the reply.
I must admit that we are rather basic in our understanding of the Rest API.
We normally just submit queries through the cypher-shell and the web
tool.
Does your mod allow for any query to be multi threaded? Even the one that
I suggested above ?
neo4j-sh (?)$ START
Hi,
I often run deep/complex queries on my very large data-set that some take
hours of run-time.
These queries appear to be single threaded and make little use of the
available CPU resources.
Am I missing something or is there a way to parallelise queries ?
A simple example might be, but
39 matches
Mail list logo
