摘要
Recently, lots of work focus on devising one-pass algorithms for processing and querying multiple data streams, such as network monitoring, sensor networks, etc. Estimating the cardinality of set expressions over streams is perhaps one of the most fundamental problems. Unfortunately, no solution has been devised for this issue over sliding windows. In this paper, we propose a space-efficient algorithmic solution to estimate the cardinality of set expression over sliding windows. Our probabilistic method is based on a new hash based synopsis, termed improved 2-level hash sketch. A thorough experimental evaluation has demonstrated that our methods can solve the problem efficiently.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 530-535 |
| 页数 | 6 |
| 期刊 | Lecture Notes in Computer Science |
| 卷 | 3399 |
| DOI | |
| 出版状态 | 已出版 - 2005 |
| 已对外发布 | 是 |
| 活动 | 7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005 - Shanghai, 中国 期限: 29 3月 2005 → 1 4月 2005 |
学术指纹
探究 'Distinct estimate of set expressions over sliding windows' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver