To further examine and characterize differences in database configurations, several network topological descriptors distributions were analyzed such as degree, shortest path length and betweenness centrality. Inand out-degree measures how many incoming and outgoing edges each node has, respectively. Shortest path length measures the length of the shortest path between two nodes. Finally, betweenness centrality measures how often a node appears on the shortest path between two other nodes. All descriptors were computed natively in Neo4j with the graph-data-science module . The process required to create so-called graph projections to compute the descriptors. Example topological descriptor distributions for degree distributions and edge betweenness are shown in Figure S??-S??, in SI.