CORR
2011
Springer
13 years 6 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
JACM
2007
13 years 11 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
ISAAC
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...