{'fraction_non_alphanumeric': 0.008658008658008658, 'fraction_numerical': 0.0, 'mean_word_length': 5.1415929203539825, '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 queueing network model of Oracle Parallel Server

An approach to modelling an Oracle database is presented for both single instance and parallel server versions. A modified queueing network is used which is extended to include traditional transaction locks which achieve serialisation and the new PCM locks of Oracle which ensure coherency in the distributed database buffers. The latter are not enqueue locks and so require different techniques. Both locks require an iterative solution to a fixed point model. The numerical results produced by the model can be validated largely using data maintained in Oracle tables and the distributed lock manager, and we identify the relevant entries.