Dear all:<div><br></div><div>I have an int list list, whose name is LL</div><div><br></div><div>and I need to frequently decide whether a particular int list, whose name is L, is a sublist of an element of LL.</div><div><br></div><div>Is there any efficent data structure to do this?</div><div><br></div><div>At the mean time, I store LL as (int, bool) Hashtbl.t list, that is, each element of LL is stored as a hash table.</div><div><br></div><div>So searching L in LL is reduce to decide whether there exist an element of LL, such every element of L hit in this element.</div><div><br></div><div>At the mean time, the space is not a big problem, but the run time overhead is major concern,</div><div><br></div><div>So if there exist any more faster data structure?</div><div><br></div><div>Thank you</div><div><br></div><div>Shen</div><div><br></div><div><br></div>