This document summarizes a proposed system for efficiently retrieving subsets of large collections of temporal patterns using signature-based indexing. The system aims to address the challenge of interpreting large numbers of patterns generated by data mining algorithms. It proposes converting temporal patterns to equivalent sets and then using a signature file (bit representation) and bit-sliced signature files to enable fast content-based querying. The system would allow subpattern, superpattern, equality, and k-nearest neighbor queries on temporal patterns. It is intended to optimize storage and retrieval of large numbers of temporal patterns discovered during data mining.