Skip to main content
deleted 77 characters in body
Source Link
Teodor Dyakov
  • 1.3k
  • 1
  • 13
  • 22

I am not sure if this is "state of the art" but take a look at this paper Efficient subset and superset queries. Basicallly you use a bitset to represent a set, and add it to a binary trie.

I am not sure if this is "state of the art" but take a look at this paper Efficient subset and superset queries. Basicallly you use a bitset to represent a set, and add it to a binary trie.

I am not sure if this is "state of the art" but take a look at this paper Efficient subset and superset queries.

Source Link
Teodor Dyakov
  • 1.3k
  • 1
  • 13
  • 22

I am not sure if this is "state of the art" but take a look at this paper Efficient subset and superset queries. Basicallly you use a bitset to represent a set, and add it to a binary trie.