(ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks
A sampling based approximate Top-k algorithm was proposed that is adaptive for any data distribution.δ≥0 and 0≤δ<1 are respectively relative error bound and failure probability bound.The theoretical analysis demonstrates that for any δ≥0 and 0≤δ<1 the probability that the relative error bound...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2011-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74417751/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|