{'fraction_non_alphanumeric': 0.012429378531073447, 'fraction_numerical': 0.0, 'mean_word_length': 4.828947368421052, '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}}
UNIVERSITÉ DE TUNIS EL MANAR FACULTÉ DES SCIENCES DE TUNIS

Decision systems deal with a large volume of data stored in new databases called data warehouses. Data warehouses are typically modeled by a star schema that conventionally presents a central fact table and a set of dimension tables. The corresponding queries for this type of model are therefore very complex. In order to reduce the cost of executing complex queries, which contain very expensive joins, the solution envisaged would be to guarantee a good physical design of the data warehouses. Binary join indexes are very suitable to reduce the cost of executing these joins. In this work, we proposed a binary join index selection approach based on the notion of minimal transversal. The final configuration obtained is composed of several indexes, which make it possible to optimize the execution cost of the query set.