Proposes recursive universe slicing for sorted integer sequences, improving intersection and union speed in compressed space compared to standard cardinality partitioning for inverted indexes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Slicing Sorted Integer Sequences
Proposes recursive universe slicing for sorted integer sequences, improving intersection and union speed in compressed space compared to standard cardinality partitioning for inverted indexes.