Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Information systems → Information retrieval query processing"'
Autor:
Arroyuelo, Diego, Castillo, Juan Pablo
We introduce space- and time-efficient algorithms and data structures for the offline set intersection problem. We show that a sorted integer set S ⊆ [0..u) of n elements can be represented using compressed space while supporting k-way intersection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::134c203edd79123512e89efa7fced612
