Hi Craig,
many thanks for your explanation.
Sorry but I am using Neo4j1.9.5, and I need to use this old version, I
can't upgrade it. So I need to mantain Neo4j Spatial which depends on
neo4j-1.9.5. Is it possible to take this code updated with multiple
location from github please?
Thank you
I think I have the reason.
Somehow my Neo4j does not want to index anything anymore. Look this:
Define Index...
++
| No data returned, and nothing was changed. |
++
1341 ms
I don't know but it's really buggy. The Shell also seems to buffer my batch
files. Needed to restartet die Server and recreate the database before he
took the new content.
Anyways I will try this one now:
USING PERIODIC COMMIT 4000
LOAD CSV WITH HEADERS FROM file:///C:/data/tls202_part01.txt
Hi All,
I have searched for some best practices to tune Neo4j for performance,
e.g., store file sizes (caching),
heap size, etc. Unfortunately, I could not find some parametrized tuning
guideline, e.g.,
given the memory size in gigabyte and graph size specify this much heap and
this much
Hello everyone,
The JCypher documentation wiki has been recently updated. Please have a
look at: https://github.com/Wolfgang-Schuetzelhofer/jcypher/wiki.
The pages: 'Home', 'Outlook (Roadmap)', 'Future Zone', and 'Future Zone
Continued' have modified and extended content.
The release date of
Thanks Craig,
What about the case where we have two point nodes, how do we compute the
length, or when we have a set of points related to a
polygon, how do we compute the area? Shall we create linestring and polygon
first and then compute length and area?
Thanks,
Best,
Alireza
On
Hi All,
Given two geometries how do compute the distance between
them in neo4j spatial? For instance given two points stored in two nodes?
What other kind of distance are defined? For instance, is it possible to
find
distance between a point and a linestring/polygon or distance between two
YOU ROCK! --- thanks!
On Monday, September 22, 2014 6:08:23 PM UTC-4, Michael Hunger wrote:
You probably have to double escape.
try:
RETURN A Z. A Z =~ '^[A-Z ]+\\. [A-Z ]+'
and in regexps you don't have to escape spaces.
On Mon, Sep 22, 2014 at 11:07 PM, David Bigelow
THANKS
On Tuesday, September 23, 2014 11:04:50 AM UTC-4, David Bigelow wrote:
YOU ROCK! --- thanks!
On Monday, September 22, 2014 6:08:23 PM UTC-4, Michael Hunger wrote:
You probably have to double escape.
try:
RETURN A Z. A Z =~ '^[A-Z ]+\\. [A-Z ]+'
and in regexps you don't have
Hello Yasser,
I began to take you up up on your suggestion.
But I had yet another problem Linux/java installation. :(
The instructions to install Talend Big Data on Redhat 6.4 is here:
http://rodgersnotes.wordpress.com/2014/09/20/installing-talend-open-studio-for-big-data-5-5-1-on-redhat-6-4/
Yes, you need to construct the polygon to calculate the area (or length).
JTS has all the tools required to do this. Look at the GeometryFactory.
On Tue, Sep 23, 2014 at 3:22 PM, Alireza Rezaei Mahdiraji
alireza...@gmail.com wrote:
Thanks Craig,
What about the case where we have two point
The distance is calculated best using JTS. For example:
double distance = pointA.distance(pointB)
See
http://tsusiatsoftware.net/jts/javadoc/com/vividsolutions/jts/geom/Geometry.html#distance(com.vividsolutions.jts.geom.Geometry)
On Tue, Sep 23, 2014 at 3:26 PM, Alireza Rezaei Mahdiraji
I did not answer everything. But the JTS distance method will work for all
geometries, so that answers most of your questions.
The GeoPipeline methods also provide ways to find objects within distances
of other objects (using the rtree for optimized searches). And it provides
sorting too, so you
Again Heap Error. I definitily need some help.
Am Dienstag, 23. September 2014 11:03:34 UTC+2 schrieb Curtis Mosters:
I don't know but it's really buggy. The Shell also seems to buffer my
batch files. Needed to restartet die Server and recreate the database
before he took the new content.
14 matches
Mail list logo
