Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,232,281 papers from all fields of science
Search
Sign In
Create Free Account
HyperLogLog
HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. Calculating the exact…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Count-distinct problem
Flajolet–Martin algorithm
Hash function
Redis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Cardinalities estimation under sliding time window by sharing HyperLogLog Counter
Jie Xu
arXiv.org
2018
Corpus ID: 53959220
Cardinalities estimation is an important research topic in network management and security. How to solve this problem under…
Expand
2017
2017
New Cardinality Estimation Methods for HyperLogLog Sketches
Otmar Ertl
arXiv.org
2017
Corpus ID: 42995555
This work presents new cardinality estimation methods for data sets recorded by HyperLogLog sketches. A simple derivation of the…
Expand
2017
2017
Estimativa de Cardinalidade da Interseção de Conjuntos Utilizando as Estruturas MinHash e HyperLogLog
J. Lopes
,
P. Pinto
,
Fabiano Oliveira
2017
Corpus ID: 194694293
Estimar a cardinalidade da interseção entre múltiplos conjuntos é um problema importante para diversas aplicações. Embora haja…
Expand
2017
2017
Location Influence in Location-based Social Networks
M. Saleem
,
Rohit Kumar
,
T. Calders
,
Xike Xie
,
T. Pedersen
Web Search and Data Mining
2017
Corpus ID: 13156761
Location-based social networks (LBSN) are social networks complemented with location data such as geo-tagged activity data of its…
Expand
2017
2017
Information Propagation in Interaction Networks
Rohit Kumar
,
T. Calders
International Conference on Extending Database…
2017
Corpus ID: 41666401
We study the potential flow of information in interaction networks, that is, networks in which the interactions between the nodes…
Expand
2016
2016
Highly Compact Virtual Counters for Per-Flow Traffic Measurement through Register Sharing
You Zhou
,
Yian Zhou
,
Min Chen
,
Qingjun Xiao
,
Shigang Chen
Global Communications Conference
2016
Corpus ID: 9744096
Per-flow traffic measurement is a fundamental problem in the era of big network data, providing critical information for many…
Expand
2016
2016
Understanding the HyperLogLog : a Near-Optimal Cardinality Estimation Algorithm
P. Flajolet
,
Éric Fusy
,
Olivier Gandouet
,
Frédéric Meunier
2016
Corpus ID: 41310511
The HyperLogLog algorithm (HLL) is a method to estimate the number of distinct elements in large datasets i.e. cardinality, in a…
Expand
2015
2015
On Distributed Cardinality Estimation: Random Arcs Recycled
Marcin Kardas
,
Mirosław Kutyłowski
,
Jakub Lemiesz
Workshop on Analytic Algorithmics and…
2015
Corpus ID: 43827344
We introduce and analyze a distributed cardinality estimation algorithm for a network consisted of not synchronized nodes. Our…
Expand
2015
2015
Cardinality Estimation in Shared-Nothing Parallel Data Flows
Tamara Mendt
2015
Corpus ID: 59950324
Shared nothing parallel dataflow systems aim to bridge the gap between MapReduce and RDBMSs by combining parallel execution of…
Expand
2014
2014
How can sliding HyperLogLog and EWMA detect port scan attacks in IP traffic?
Yousra Chabchoub
,
Raja Chiky
,
Betul Dogan
EURASIP Journal on Information Security
2014
Corpus ID: 256244344
IP networks are constantly targeted by new techniques of denial of service attacks (SYN flooding, port scan, UDP flooding, etc…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE