A unified scheme for generalizing cardinality estimators to sum aggregation

Reuven Cohen; Liran Katzir; Aviv Yehezkel

doi:10.1016/j.ipl.2014.10.009

A unified scheme for generalizing cardinality estimators to sum aggregation

Reuven Cohen, Liran Katzir, Aviv Yehezkel

Technion-Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

Cardinality estimation algorithms receive a stream of elements that may appear in arbitrary order, with possible repetitions, and return the number of distinct elements. Such algorithms usually seek to minimize the required storage at the price of inaccuracy in their output. This paper shows how to generalize every cardinality estimation algorithm that relies on extreme order statistics (min/max sketches) to a weighted version, where each item is associated with a weight and the goal is to estimate the total sum of weights. The proposed unified scheme uses the unweighted estimator as a black-box, and manipulates the input using properties of the beta distribution.

Original language	English
Pages (from-to)	336-342
Number of pages	7
Journal	Information Processing Letters
Volume	115
Issue number	2
DOIs	https://doi.org/10.1016/j.ipl.2014.10.009
State	Published - Feb 2015
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2014 Elsevier B.V. All rights reserved.

Funding

The research leading to these results has received funding from the European Community's Seventh Framework Programme (FP7/2007–2013) under grant agreement No. 610802 .

Funders	Funder number
Seventh Framework Programme	610802
Seventh Framework Programme

Keywords

Algorithms
Big data processing
Statistical

Access to Document

10.1016/j.ipl.2014.10.009

Cite this

@article{fa2fb0d0a3944dbf8d0bd0f8c0e022d7,

title = "A unified scheme for generalizing cardinality estimators to sum aggregation",

abstract = "Cardinality estimation algorithms receive a stream of elements that may appear in arbitrary order, with possible repetitions, and return the number of distinct elements. Such algorithms usually seek to minimize the required storage at the price of inaccuracy in their output. This paper shows how to generalize every cardinality estimation algorithm that relies on extreme order statistics (min/max sketches) to a weighted version, where each item is associated with a weight and the goal is to estimate the total sum of weights. The proposed unified scheme uses the unweighted estimator as a black-box, and manipulates the input using properties of the beta distribution.",

keywords = "Algorithms, Big data processing, Statistical",

author = "Reuven Cohen and Liran Katzir and Aviv Yehezkel",

year = "2015",

month = feb,

doi = "10.1016/j.ipl.2014.10.009",

language = "אנגלית",

volume = "115",

pages = "336--342",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A unified scheme for generalizing cardinality estimators to sum aggregation

AU - Cohen, Reuven

AU - Katzir, Liran

AU - Yehezkel, Aviv

PY - 2015/2

Y1 - 2015/2

N2 - Cardinality estimation algorithms receive a stream of elements that may appear in arbitrary order, with possible repetitions, and return the number of distinct elements. Such algorithms usually seek to minimize the required storage at the price of inaccuracy in their output. This paper shows how to generalize every cardinality estimation algorithm that relies on extreme order statistics (min/max sketches) to a weighted version, where each item is associated with a weight and the goal is to estimate the total sum of weights. The proposed unified scheme uses the unweighted estimator as a black-box, and manipulates the input using properties of the beta distribution.

AB - Cardinality estimation algorithms receive a stream of elements that may appear in arbitrary order, with possible repetitions, and return the number of distinct elements. Such algorithms usually seek to minimize the required storage at the price of inaccuracy in their output. This paper shows how to generalize every cardinality estimation algorithm that relies on extreme order statistics (min/max sketches) to a weighted version, where each item is associated with a weight and the goal is to estimate the total sum of weights. The proposed unified scheme uses the unweighted estimator as a black-box, and manipulates the input using properties of the beta distribution.

KW - Algorithms

KW - Big data processing

KW - Statistical

UR - http://www.scopus.com/inward/record.url?scp=84911893094&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2014.10.009

DO - 10.1016/j.ipl.2014.10.009

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

SN - 0020-0190

VL - 115

SP - 336

EP - 342

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

A unified scheme for generalizing cardinality estimators to sum aggregation

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this