{'fraction_non_alphanumeric': 0.01665034280117532, 'fraction_numerical': 0.0, 'mean_word_length': 4.976608187134503, '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}}
The Effect of Partitioning and Indexing on Data Access Time

An increasing amount of data is stored and managed in today's information systems. For this purpose, relational databases are used very often. Fast access to data is becoming increasingly important and great emphasis is placed on its improvement. The data access time can be significantly improved by creating partitions and index structures, or their combinations. From the point of view of efficiency, it is not appropriate or necessary to access all data. They can be divided into smaller parts, which will facilitate the execution of certain operations and bring efficiency, whether in terms of time or performance. As far as indexing is concerned, there is also an opportunity to access only the data sought, thus avoiding the Table Access Full method. This paper deals with the effect of partitioning and indexing on data access time, which is compared in seven different scenarios of different combinations of partitions created over tables and indexes.