Return to Question

Suppose I have a set of sets of integers $A$, is there an efficient algorithm/data structure that will allow me to query for all sets of integers that include a given input set? That is, given input $I\subset \mathbb Z$, $\forall x \in I$ find $C$, the sets in $A$ that include all of $I$, that is $C=\left\{ B \in A \mid I\subseteq B\right\}$.

Looking for the best of a few solutions.

Suppose I have a set of sets of integers $A$, is there an efficient algorithm/data structure that will allow me to query for all sets of integers that include a given input set? That is, given input $I\subset \mathbb Z$, find $C$, the sets in $A$ that include all of $I$, that is $C=\left\{ B \in A \mid I\subseteq B\right\}$.

Looking for the best of a few solutions.

Suppose I have a set of sets of integers $A$, is there an efficient algorithm/data structure that will allow me to query for all sets of integers that include a given input set? That is, given input $I\subset \mathbb Z$, $\forall x \in I$ find $C$, the sets in $A$ that include all of $I$, that is $C=\left\{ B \in A \mid B\subseteq I\right\}$.

Looking for the best of a few solutions.

Suppose I have a set of sets of integers $A$, is there an efficient algorithm/data structure that will allow me to query for all sets of integers that include a given input set? That is, given input $I\subset \mathbb Z$, $\forall x \in I$ find $C$, the sets in $A$ that include all of $I$, that is $C=\left\{ B \in A \mid I\subseteq B\right\}$.

Looking for the best of a few solutions.

Suppose I have a set of sets of integers $A$, is there an efficient algorithm/data structure that will allow me to query for all sets of integers that include a given input set? That is, given input $I$, $\forall_{x \in I}x\in\mathbb Z$ find $C$, the sets in $A$ that include all of $I$, or $C=\left\{ B \in A \space | B\subseteq I\space \right\}$.

Looking for the best of a few solutions.

Suppose I have a set of sets of integers $A$, is there an efficient algorithm/data structure that will allow me to query for all sets of integers that include a given input set? That is, given input $I\subset \mathbb Z$, $\forall x \in I$ find $C$, the sets in $A$ that include all of $I$, that is $C=\left\{ B \in A \mid B\subseteq I\right\}$.

Looking for the best of a few solutions.