How to construct a special data structure that allows for "fast" subset operation?
Represent sets as Bit Sets. Java has built-in implementation. A is subset of B if A &amp; B = A. These operations on bit sets are fast (O(1) ).