{'fraction_non_alphanumeric': 0.009900990099009901, 'fraction_numerical': 0.0, 'mean_word_length': 4.992592592592593, '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}}
Access rule consistency in cooperative data access environment

In this paper we consider the situation where a set of enterprises need to collaborate to provide rich services to their clients. Such collaboration often requires controlled access to each other's data, which we assume is stored in standard relational form. The access control is provided by a set of access rules that may be defined over the joins of various relations. In this paper we introduce the notion of consistency of access rules and devise an algorithm to ensure consistency. We also consider the possibility of occasional changes in access rules and address the problem of maintaining consistency in the face of such changes. We propose algorithms for both changes with new privileges grants and revocations on existing privileges.