{'fraction_non_alphanumeric': 0.014380530973451327, 'fraction_numerical': 0.0, 'mean_word_length': 5.284722222222222, '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}}
A Probabilistic Database Model with Representability of Dependency among Tuples

Most of the probabilistic database models proposed so far represent probabilistic information by attaching the existence probability of each tuple to the tuple. However, these models are not able to represent dependency among tuples such as “at least one tuple of two or more tuples must exist in a database.” In this paper, we propose a probabilistic database model which has the ability to represent such dependency. As a basic framework of our model, we adopt conditional tables introduced by Imielinski and Lipski, which have been proposed as a model for incomplete information. Furthermore, we consider the problem of computing the existence probability of a given tuple over our proposed model and discuss its computational complexity. Several conditions which make the problem solvable efficiently are also provided.