Figure 1
An Example of a Relational Database versus a Graph Database Structure. On the top, the node table on the left and the edge table on the right represent that the three lawyers are connected to each other when combined together in a relational database. In contrast, the graph database structure on the bottom directly represents the nodes and edges (with properties).
Figure 2
Schema and Data Summary of the Graph Database.
Figure 3
Query Result in the Neo4j Browser of Lawsuits by Chinese Plaintiffs and Their Filing Dates at Local Courts.
Figure 4
Simple Visualization of One Lawsuit and Connected Nodes in Neo4j Browser.
Figure 5
Excerpt and Pie Chart from the Lawsuit Filings Tabulation Exported from the Database.
Figure 6
End-Point Snapshot of Time-lapse of Lawsuits Filed in Japanese Courts from 1970s to 2010s: A time-lapse view can be accessed at https://graphxr.kineviz.com/share/610cd4dd7218aa003c1fcfb0/lawsuit/6114a2507218aa003c268e32 (with the “Filter” function on the left of the GraphXR interface).
Figure 7
End-Point Snapshot of Time-Lapse of Lawsuits by Origin of the Plaintiffs Visualized in 2D and 3D Space: A time-lapse view can be accessed at https://graphxr.kineviz.com/share/610cd4 dd7218aa003c1fcfb0/lawsuit/615def8e782c180052a81724.