{'fraction_non_alphanumeric': 0.02861952861952862, 'fraction_numerical': 0.0, 'mean_word_length': 5.257894736842105, '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}}
Differential Privacy Spatial Decomposition via Flattening Kd-Tree

The key problem of using differential privacy is controlling sensitivity. Almost all papers focus on processing sensitivity, but the efficiency of the algorithm is also very important. Therefore, this paper hopes to improve efficiency as much as possible under the premise of ensuring utility. In this paper, decomposition and reconstruction via flattening kd-tree (DRF) is proposed based on differential privacy, which applies a flattening kd-tree to process the adjacency matrix. Firstly, by adjusting the vertex labeling, the set of labeling form dense areas and sparse areas as much as possible in the adjacency matrix. The adjacency matrix is then decomposed by flattening kd-tree, and each sub-region is anonymously operated using differential privacy. Finally, each subregion is reconstructed to obtain a complete anonymous graph. At the end of the article, experiments are conducted over real-world datasets. According to the results, DRF has a significant improvement in efficiency, the time complexity of DRF is O(|V|), and DRF has a good performance in degree distribution, degree centrality and cutting query.