{'fraction_non_alphanumeric': 0.025799793601651185, 'fraction_numerical': 0.0, 'mean_word_length': 4.843373493975903, '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}}
BdH-Tree: A B+-Tree Based Indexing Method for Very Frequent Updates of Moving Objects

Several methods to index positions of moving objects have been proposed. Most of them are based on R-tree-like index structures. Some studies have made efforts to improve the update performance of R-trees, and they actually focus on query performance. Even though the update performance has been improved by virtue of those researchers' efforts, the overhead and immaturity of the concurrency control algorithms of R-trees make us hesitant to choose them for moving objects. In this paper, we propose an update-efficient indexing method. The proposed index is based on B+-tree and the Hilbert curve. We present an advanced Hilbert curve that automatically adjusts the order of the Hilbert curve in subregions, according to the data distribution. Through empirical study, we show that our strategy achieves a faster response time and higher throughput than those of other strategies.