VATE: A trade-off between memory and preserving time for high accurate cardinality estimation under sliding time window
Authors:
- Jie XuJXJie Xu
- Wei DingWDWei Ding
- Xiaoyan HuXHXiaoyan Hu
- Qiushi GongQGQiushi Gong
- 1 April 2019
- journal article
- research article
- Published by Elsevier in Computer Communications
- Vol. 138, 20-31
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (61602114)
This publication has 28 references indexed in Scilit:
- Cardinality estimation using collective interference for large-scale RFID systemsJournal of Network and Computer Applications, 2017
- CVS: Fast cardinality estimation for large-scale data streams over sliding windowsNeurocomputing, 2016
- Detection of Superpoints Using a Vector Bloom FilterIEEE Transactions on Information Forensics and Security, 2015
- Evasion-resistant network scan detectionSecurity Informatics, 2015
- High frequency batch-oriented computations over large sliding time windowsFuture Generation Computer Systems, 2015
- How to catch -heavy-hitters on sliding windowsTheoretical Computer Science, 2014
- A grand spread estimator using a graphics processing unitJournal of Parallel and Distributed Computing, 2014
- Maintaining Stream Statistics over Sliding WindowsSIAM Journal on Computing, 2002
- A linear-time probabilistic counting algorithm for database applicationsACM Transactions on Database Systems, 1990
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985