{'fraction_non_alphanumeric': 0.01992966002344666, 'fraction_numerical': 0.004689331770222743, 'mean_word_length': 5.671875, '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 Pattern Confidentiality-Preserving Relational Databases: Deployment Concept and Efficiency Evaluation

In this paper, we address the question whether access pattern confidentiality-preserving databases with an underlaying B-tree index structure are feasible in practice by proposing integrative deployment concepts that support important database query functionalities based on ORAM and shuffled B-trees. Furthermore, we provide a rigorous efficiency evaluation to determine the cost of the proposed concepts with regard to storage, network, and query latency as well as to investigate the influence of scenario factors like database size, number of records, and network bandwidth. In particular, we show that ORAM-based concepts only cause an overhead of factor 5.9 for evaluating equality conditions on a database with up to 10 million records.