Sliding Window Top-K Monitoring over Distributed Data Streams
Abstract Most of the traditional top-k algorithms are based on a single-server setting. They may be highly inefficient and/or cause huge communication overhead when applied to a distributed system environment. Therefore, the problem of top-k monitoring in distributed environments has been intensivel...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2017-11-01
|
| Series: | Data Science and Engineering |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s41019-017-0053-1 |