# Item

ITEM ACTIONSEXPORT

Released

Report

#### Lower bound for set intersection queries

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

MPI-I-92-127.pdf

(Any fulltext), 10MB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Mehlhorn, K., Uhrig, C., & Raman, R.(1992). *Lower bound
for set intersection queries* (MPI-I-92-127). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B706-D

##### Abstract

We consider the following {\em set intersection reporting\/} problem.
We have a collection of initially empty sets and would like to
process an intermixed sequence of $n$ updates (insertions into and
deletions from individual sets) and $q$ queries (reporting the
intersection of two sets). We cast this problem in the
{\em arithmetic\/} model of computation of Fredman
and Yao and show that any algorithm that fits
in this model must take $\Omega(q + n \sqrt{q})$ to
process a sequence of $n$ updates and $q$ queries,
ignoring factors that are polynomial in $\log n$.
By adapting an algorithm due to Yellin
we can show that this bound
is tight in this model of computation, again
to within a polynomial in $\log n$ factor.