Significant-Presence Range Queries in Categorical Data

@inproceedings{Berg2003SignificantPresenceRQ,
  title={Significant-Presence Range Queries in Categorical Data},
  author={Mark de Berg and Herman J. Haverkort},
  booktitle={WADS},
  year={2003}
}
In traditional colored range-searching problems, one wants to store a set of n objects with m distinct colors for the following queries: report all colors such that there is at least one object of that color intersecting the query range. Such an object, however, could be an ‘outlier’ in its color class. Therefore we consider a variant of this problem where one has to report only those colors such that at least a fraction τ of the objects of that color intersects the query range, for some… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Range Searching

  • P. K. Agarwal
  • J. Goodman and J. O’Rourke (Eds.), CRC Handbook…
  • 1997
Highly Influential
6 Excerpts

and

  • P. K. Agarwal, S. Govindarajan
  • S. Muthukrishnan. Range searching in categorical…
  • 2002
Highly Influential
5 Excerpts

Widmayer . Spatial data structures : concepts and design choices

  • J. Nievergelt, P.
  • Proc . 14 th Annu . Int . Sympos . on Algorithms…
  • 2003

Similar Papers

Loading similar papers…