This paper presents a data structure for storing and querying sets. The data structure is based on tries, but because the order of elements in a set is not important (unlike letters in a string) we are able to implement additional subset and superset query operations besides the trie's insert and search operation. The operations and their algorithms are described. We empirically analyze the operations in a series of experiments and present the results.
['Staš Bevc', 'Iztok Savnik']
Using tries for subset and superset queries