{'fraction_non_alphanumeric': 0.013317191283292978, 'fraction_numerical': 0.0, 'mean_word_length': 5.125925925925926, '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}}
Query cost estimation for read intensive flash memory based database systems

Flash memory database systems are relatively new area of research interest in computing community. Most database techniques, already developed and proposed, are based on the assumption that the database is hard disk resident, due to this fact the cost measurement of query algorithms is highly dependent on the mechanical nature of hard disks. But the read, write, erase behavior of flash memories are radically different from hard disks, so that new measures of query costs that are tuned by the characteristics of flash memories should be introduced. In this paper we propose a new query cost measurement procedure for read intensive queries like join. We then compare and contrast already developed join algorithms with the new cost measurement.