Using virtual nodes

“If it looks like a node, smells like a node and feels like a node then it is a node”

In other words; our NetworkView will display anything that has the data structure of a node as as node.
That opens up great possibilities for the creation of ‘virtual nodes’ that exist only in the visualization but are not written to the underlying data store. This is a useful strategy for situations where you want to temporarily aggregate information from different related nodes and/or want to style your nodes dynamically based on its relations to the rest of the graph. Another application can be the case where you need to do a scenario analysis in a multi-user environment without writing to the underlying database.

Below is a simple demonstration that merges properties from different nodes into a virtual node which only exists in the browser and is not written to store. This is achieved by making the query return a data structure that contains the following fields: id, labels and properties. The demo uses the Neo4j APOC map.merge function to merge the properties from two nodes into one which means that you will need to install the APOC library onto your Neo4j installation first.

Run the below Cypher script to install six data nodes and three relations on which we base this demo.

CREATE (_1:Person:VirtualMergeDemo {`name`:'Mo', `age`:'30'})
CREATE (_2:Person:VirtualMergeDemo {`name`:'Max', `age`:'45'})
CREATE (_3:Person:VirtualMergeDemo {`name`:'Mary',`age`:'28'})
CREATE (_4:TimeRecord:VirtualMergeDemo{`work`:'8',`eat`:'2',`relax`:'5',`sport`:'1', `sleep`:'8'})
CREATE (_5:TimeRecord:VirtualMergeDemo{`work`:'4',`eat`:'3',`relax`:'8',`sport`:'0', `sleep`:'9'})
CREATE (_6:TimeRecord:VirtualMergeDemo{`work`:'6',`eat`:'1',`relax`:'9',`sport`:'2', `sleep`:'6'})

We can run the following Cypher directly from the OpenCypher box to demonstrate both the merging of properties, using APOC map.merge, and the creation of virtual nodes.

MATCH (n:Person)-->(t:TimeRecord)
} AS person

This returns three Person nodes that contain the merged properties.

Note that when you inspect these nodes using KeysView you will not see the merged properties. This is because the virtual nodes have been given the ids of their original Person nodes and KeysView makes a query round-trip to the underlying database to obtain the properties.

However, when you inspect the new virtual nodes using the right-click ‘Details’ option you will see that the properties are merged

The combination of virtually merged nodes and dynamic styling is especially useful.

In the above example we have styled the virtual nodes based on the number of hours worked.
This results in the node border being painted red when more than 5 hours are worked






Node properties can also be merged selectively as in the below example where the node name -resulting in the node caption- is virtually updated based on the number of hours worked.

MATCH (n:Person)-->(t:TimeRecord) RETURN {
properties:{name: +" (offtime:" + (24 - toInt(")"}
} AS person

Card image cap
Graphileon to Support DataStax Enterprise Graph

DataStax, the company behind the leading database built on Apache Cassandra™, today announced a technology partnership with Graphileon to include support for DataStax Enterprise Graph (DSE Graph) on Graphileon’s application development platform. Developers using DSE Graph will now be able to leverage Graphileon’s platform for simpler coding and easier visualization of graph data. DSE Graph enables enterprises to extract … Continued

Card image cap
Cambridge Semantics Adds Graphileon to AnzoGraph®

Cambridge Semantics, the leading provider of modern data discovery and integration software for enterprise data fabrics, today announced the integration of Graphileon framework with its stand-alone version of AnzoGraph, a leading graph analytics database. With this integration, AnzoGraph developers and customers benefit from Graphileon’s market-leading ability to navigate, manage and visualize the content of multiple … Continued

Card image cap
Analysis of scenarios demo, installation script and explanation

A while ago, Tom posted a video called Analysis of scenarios in Graphileon. In this video he demonstrates a Graphileon application that takes a network and uses a graph algorithm to find a shortest path between two nodes. While this in itself is not very spectacular -it’s one of the reasons graph databases are used in … Continued

Get started with the Personal Edition

The easiest way to get to know Graphileon is by using the Personal Edition. Build graphy applications and browse your graph stores in a way you never did before.