{'fraction_non_alphanumeric': 0.019904458598726114, 'fraction_numerical': 0.0031847133757961785, 'mean_word_length': 4.901408450704225, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Transforming RDF to Property Graph in Hugegraph

The data form in the graph data is divided into RDF and property graph. RDF appeared earlier, but it is generally larger and the data is more redundant. In the property graph, a graph is defined by properties, nodes and edges. It is easier to set property to the edges, which is more helpful for the description of the graph, so it is of great research significance to transform RDF graph to property graph. However, because the structure of RDF and property graph are naturally different, transforming RDF to property graph needs to solve the distinction of nodes and properties while ensuring the uniqueness of the nodes, supporting multiple labels and empty labels in a single-label graph database and other difficulties. In this paper, through analyzing a variety of serialized data, we proposed a specific mapping mechanism to solve the first issue. Through the method of storing the label information of the node with additional fields, we have successfully solved the second issue. Finally, through experimental verification of a specific dataset, we found that the converted data volume was reduced by about 10% to 20%, and it can successfully complete the query requirements in different scenarios.