(ε,δ)-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!
|
| _version_ | 1841537818171539456 |
|---|---|
| author | BI Ran LI Jian-zhong CHENG Si-yao |
| author_facet | BI Ran LI Jian-zhong CHENG Si-yao |
| author_sort | BI Ran |
| collection | DOAJ |
| description | 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 of the results returned by this algorithm is larger than ε/（1+ε） is less than δ.So the proposed algorithm can reach arbitrary precision.Furthermore,an optimal sampling algorithm was proposed that supported the approximate Top-k query,and through the technique of data filtering the en-ergy consumption of communication was reduced.Theoretical analysis and simulation show that the proposed algorithm is efficient and consumes little energy. |
| format | Article |
| id | doaj-art-b181e52ba4d14c65995690661ffde2a9 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2011-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-b181e52ba4d14c65995690661ffde2a92025-01-14T08:22:20ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2011-01-0132455474417751(ε,δ)-approximate Top-k query processing algorithm in wireless sensor networksBI RanLI Jian-zhongCHENG Si-yaoA 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 of the results returned by this algorithm is larger than ε/（1+ε） is less than δ.So the proposed algorithm can reach arbitrary precision.Furthermore,an optimal sampling algorithm was proposed that supported the approximate Top-k query,and through the technique of data filtering the en-ergy consumption of communication was reduced.Theoretical analysis and simulation show that the proposed algorithm is efficient and consumes little energy.http://www.joconline.com.cn/zh/article/74417751/approximate Top-k querysampling algorithmwireless sensor networks |
| spellingShingle | BI Ran LI Jian-zhong CHENG Si-yao (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks Tongxin xuebao approximate Top-k query sampling algorithm wireless sensor networks |
| title | (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks |
| title_full | (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks |
| title_fullStr | (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks |
| title_full_unstemmed | (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks |
| title_short | (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks |
| title_sort | ε δ approximate top k query processing algorithm in wireless sensor networks |
| topic | approximate Top-k query sampling algorithm wireless sensor networks |
| url | http://www.joconline.com.cn/zh/article/74417751/ |
| work_keys_str_mv | AT biran edapproximatetopkqueryprocessingalgorithminwirelesssensornetworks AT lijianzhong edapproximatetopkqueryprocessingalgorithminwirelesssensornetworks AT chengsiyao edapproximatetopkqueryprocessingalgorithminwirelesssensornetworks |