How do database management systems utilize sophisticated indexing methodologies like B-trees, R-trees, and hash-based indexing to enhance the efficiency of data retrieval operations? Furthermore, what are the inherent trade-offs linked with each indexing technique concerning storage utilization, query processing speed, and concurrency management?