Data wrangling for ArcGIS to Cypher

100%

Data wrangling for ArcGIS to Cypher

✓ Published0🌍 Public

Last edited Aug 14, 2014

Created on Aug 14, 2014

This example shows how raw tabular GIS data is wrangled into a node-and-edge format suitable for importing into a graph database like Neo4j via Cypher. It extracts distinct pairs of connected points from an ArcGIS feature table by computing start and stop coordinates from X/Y fields and their offsets, then filters out self-loops where start equals stop. The code uses the XQuery language with the `fn:distinct-values`, `fn:data`, and `string-join` functions to build a comma-separated list of connected node IDs and edge lengths. It explicitly demonstrates the data-cleaning step—removing duplicate or invalid connections—before the result is ready for Cypher’s `LOAD CSV` or `MERGE` commands.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist adbe358483e7e878175e

This example visualizes a network of places connected by paths, with each link representing a reciprocal route and its distance. The visualization shows the graph structure using a force-directed layout, where nodes are positioned based on their connections. The code loads relational data from a CSV file using Cypher’s `LOAD CSV`, then merges bidirectional `Path` relationships between `Place` nodes. The rendering relies on the Neo4j graph model and likely uses D3.js’s `forceSimulation` to compute node positions and link distances, though the snippet focuses on data ingestion via Cypher rather than the display layer. The graph reveals clusters of tightly interconnected locations based on the distance metadata.

CCliffordAnderson

68% match

Loading thumbnail…

Test Network

The visualization displays a test network of paths between points, with lines representing connections and distances. The data originates from a CSV file with columns for start and end points, distances, path types, and metadata. The XQuery script fetches, parses, and deduplicates the records before rendering. This example highlights how network connectivity and edge attributes (e.g., distance, path type) can be mapped to visual encodings to explore spatial relationships and potential routing constraints.

CCliffordAnderson

65% match

Loading thumbnail…

Graph Analysis for the Humanities

This workshop introduces humanities scholars to graph-based data modeling and analysis, presenting a series of hands-on exercises that build from introductory Neo4j concepts to practical applications. It demonstrates how to create graph data models, write Cypher queries, and render interactive visualizations in the browser. The material shows loading Berlin metro data from Wikidata via XQuery and BaseX, then visualizing those connections with Neovis.js, a JavaScript library built on Neo4j's Bolt protocol. The exercise set culminates in web development, using a Python SimpleHTTPServer to deploy graph-based websites.

CCliffordAnderson

63% match

Loading thumbnail…

Cypher for determining distance between points using shortest path

This example demonstrates how to calculate the distance between two points in a graph using Cypher's shortest path algorithm. The query first matches two nodes by their IDs, then applies `shortestpath` to find the minimal path between them. Using the `reduce` function, it iterates over the relationships in that path, summing the `distance` property of each relationship to return the total distance in meters. The visualization relies on the Neo4j graph database and its Cypher query language, with the underlying graph structure and relationship properties providing the data for the calculation.

CCliffordAnderson

61% match

Loading thumbnail…

Gist fdfc88707da3d0b9b203

This example shows the clustering and connection of points on a map based on their geographic proximity and shared attributes. It uses a force-directed layout via `d3.forceSimulation` to position nodes while links are drawn as curved paths, with a base projection provided by `d3.geoPath` and `d3.geoMercator`. The data is loaded from an external CSV file, and the visualization updates dynamically as the simulation runs, highlighting node neighborhoods and their interconnections.

MMSCAU

61% match

Loading thumbnail…

Graph Gist

This example renders a small Cypher query result as an interactive force-directed graph. It uses d3.forceSimulation to position nodes and links, displaying person and database entities with their LIKE relationships from the Neo4j sample data. The graph draws SVG circles and connecting lines, with labels for each node, and updates positions through the simulation's tick events.

CCliffordAnderson

60% match

Loading thumbnail…

Cypher for Spatial

This example demonstrates the spatial capabilities of Neo4j’s Cypher query language by finding the nearest city to a given point in Germany. It shows how to combine geographic coordinates with graph traversal to return a ranked list of nearby cities, ordered by distance. The visualization uses `spatial.closest` from the Neo4j Spatial library, with a query that computes distances via the `distance()` function in kilometers. The accompanying data files include a GeoJSON point for the starting location and an exported CSV of city names with distances, while the code references adding a layer and populating it with cities from a Gist. The result is a straightforward map-based proximity search, rendered as a tabular list rather than a graphical map.

CCliffordAnderson

60% match

Loading thumbnail…

Graph Gist

This example shows a small graph of people and their database preferences, capturing two `Person` nodes connected by `LIKE` relationships to database nodes labeled `Database`, `NoSql`, and `Graph`. The visualization renders this graph data using D3.js, likely with a force-directed layout (`d3.forceSimulation`) to position nodes and links, and possibly `d3.geoPath` or standard SVG/CSS for shapes and labels. The source code, authored by CliffordAnderson and stored as a Gist, explicitly creates the nodes and relationships with Cypher, returning them for immediate display. The result emphasizes how graph structures and their labels can be directly mapped from query output to interactive visual elements.

CCliffordAnderson

59% match