41 search results - page 9 / 9 » Tight Lower Bounds for Query Processing on Streaming and Ext... |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...