{'fraction_non_alphanumeric': 0.022026431718061675, 'fraction_numerical': 0.011013215859030838, 'mean_word_length': 4.9868421052631575, '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}}
On modeling the query processing-relevant complexity of 2-D spatial objects

We present a conceptual framework for looking at query processing oriented complexity measures for spatial objects. We look at benefits that could result from development of such a measure. While Brinkhoff et. al. (1995) presented a complexity measure, they did not offer much theoretical justification for their choice of parameters nor for the functional form that they used.