.png){kind=icon}
返回
Address Block Counting Using Two-Tier Cardinality Estimation
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2938977.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An address block is defined as a set of continuous addresses between two points in an address space. Counting the number of distinct address blocks that have been accessed during a measurement period can provide useful information for cyber security, computer networks, and storage systems. However, this counting problem becomes challenging when addresses are accessed randomly since adjacent addresses must be carefully identified and merged into one block. This study presents a new algorithm that can accurately estimate the number of distinct address blocks where each address access is monitored only once. This new algorithm requires only three counters to keep the numbers of distinct addresses and one-bit truncated addresses, respectively, in two-tier counting architecture. Both time and space complexities are significantly improved because only three counters are required for cardinality estimation instead of traditional hash table or tree data structures. Experimental results show that the new scheme saves more than 50% memory space and runs two times faster than a tree-based existing algorithm; the relative error of estimation is less than 10%.
Keyword:
Cardinality estimation
streaming algorithm
data analysis
counting
ransomware
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏A new role for Mos inXenopusoocyte maturation: targeting Myt1 independently of MAPK.png)
Development
DevelopmentIF0
PREAI
分享收藏Voluntary behaviour, knowledge sharing and quality management system implementation in pharmaceutical industry: a preliminary study制药行业的自愿行为，知识共享和质量管理体系实施: 一项初步研究
PREAI
分享收藏 没有更多内容
没有更多内容