Imagine a scenario where we need to store and query 10 million unique strings with an average length of 50 characters. The operations required are: exact match search, prefix search, and fuzzy match (edit distance of 1). Standard Tries are too memory-intensive, and Hash Tables do not support prefix/fuzzy search efficiently. Propose a hybrid data structure or a modification of an existing one that optimizes for both memory usage and search speed. Provide the Big-O time and space complexity analysis for each of the three required operations and explain your trade-offs.