2026-07-24T00:57:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5648 2024-03-06T10:36:45Z ddc:004 open_access

On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model Bishnu, Arijit Chakrabarti, Amit Nandy, Subhas C. Sen, Sandeep Density threshold emptiness queries interval queries streaming model heavy hitter frequency estimation In this paper, we study the maximum density, threshold and emptiness queries for intervals in the streaming model. The input is a stream S of n points in the real line R and a floating closed interval W of width alpha. The specific problems we consider in this paper are as follows. - Maximum density: find a placement of W in R containing the maximum number of points of S. - Threshold query: find a placement of W in R, if it exists, that contains at least Delta elements of S. - Emptiness query: find, if possible, a placement of W within the extent of S so that the interior of W does not contain any element of S. The stream S, being huge, does not fit into main memory and can be read sequentially at most a constant number of times, usually once. The problems studied here in the geometric setting have relations to frequency estimation and heavy hitter identification in a stream of data. We provide lower bounds and results on trade-off between extra space and quality of solution. We also discuss generalizations for the higher dimensional variants for a few cases. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arijit Bishnu and Amit Chakrabarti and Subhas C. Nandy and Sandeep Sen 2015 Is Part Of LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2015.336 urn:nbn:de:0030-drops-56488 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.336 eng https://creativecommons.org/licenses/by/3.0/legalcode