Optimal storage & retrieval in m*n sparse matrix

Source summary

Demonstrate efficient storage and near-real-time retrieval for a merchant-by-pincode serviceability matrix. The source's example scale is ten million participating merchants by thirty thousand pincodes. Include an input interface for the sparse matrix and queries for one or more pincodes, preserving the separation between sellers defining coverage and buyer apps checking it.