Processing top-\(k\) queries from samples

DOI10.1016/j.comnet.2008.04.021zbMath1173.68476OpenAlexW1998026880MaRDI QIDQ948026

Nadav Grossaug, Haim Kaplan, Edith Cohen

Publication date: 8 October 2008

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2008.04.021

zbMATH Keywords

samplingestimationconfidence intervalsheavy hitterstop-\(k\) items

Mathematics Subject Classification ID

Database theory (68P15) Network design and communication in computer systems (68M10) Data structures (68P05)

Related Items (2)

Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey ⋮ Space-efficient estimation of statistics over sub-sampled streams

This page was built for publication: Processing top-\(k\) queries from samples