We describe how various sparse matrix and distribution formats can be handled using the {\em relational} approach to sparse matrix code compilation. This approach allows for the development of compilation techniques that are independent of the storage formats by viewing the data structures as relations and abstracting the implementation details as access methods.