降低传感器云服务中top-k监控的费用

Kamalas Udomlamlert, T. Hara
{"title":"降低传感器云服务中top-k监控的费用","authors":"Kamalas Udomlamlert, T. Hara","doi":"10.1145/2933267.2935090","DOIUrl":null,"url":null,"abstract":"In sensor cloud services, the expense is charged based on the amount of resource usage, e.g. data requests. This paper originally presents an expense-minimizing framework for top-k monitoring in sensor cloud services where the expense is denoted by the costs of data requests. Instead of fetching all the latest data in each timestamp, we propose a novel ε-top-k query delivering approximate top-k answers with a probabilistic guarantee on the selectively-fetched dataset which is a combination of certain and uncertain data (modelled by their age). In addition, using a cloud environment as well as our proposed method to process ε-top-k queries can alleviate the computing-intensive computations, so it is not only cheaper but even faster than an ordinary top-k calculation method. The extensive experiments on the real-world climate datasets demonstrate that our methods can reduce the expense by more than half with desirable accuracy.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reducing expenses of top-k monitoring in sensor cloud services\",\"authors\":\"Kamalas Udomlamlert, T. Hara\",\"doi\":\"10.1145/2933267.2935090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In sensor cloud services, the expense is charged based on the amount of resource usage, e.g. data requests. This paper originally presents an expense-minimizing framework for top-k monitoring in sensor cloud services where the expense is denoted by the costs of data requests. Instead of fetching all the latest data in each timestamp, we propose a novel ε-top-k query delivering approximate top-k answers with a probabilistic guarantee on the selectively-fetched dataset which is a combination of certain and uncertain data (modelled by their age). In addition, using a cloud environment as well as our proposed method to process ε-top-k queries can alleviate the computing-intensive computations, so it is not only cheaper but even faster than an ordinary top-k calculation method. The extensive experiments on the real-world climate datasets demonstrate that our methods can reduce the expense by more than half with desirable accuracy.\",\"PeriodicalId\":277061,\"journal\":{\"name\":\"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2933267.2935090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2933267.2935090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在传感器云服务中,费用是根据资源使用量(例如数据请求)收取的。本文最初提出了一个用于传感器云服务中top-k监控的费用最小化框架,其中费用由数据请求的成本表示。我们提出了一种新颖的ε-top-k查询,在选择性获取的数据集上提供近似的top-k答案,而不是在每个时间戳中获取所有最新的数据,该数据集是确定和不确定数据(按年龄建模)的组合。此外,使用云环境和我们提出的方法来处理ε-top-k查询可以减轻计算密集型的计算,因此它不仅便宜而且比普通的top-k计算方法更快。在真实世界气候数据集上进行的大量实验表明,我们的方法可以将成本降低一半以上,并具有理想的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reducing expenses of top-k monitoring in sensor cloud services
In sensor cloud services, the expense is charged based on the amount of resource usage, e.g. data requests. This paper originally presents an expense-minimizing framework for top-k monitoring in sensor cloud services where the expense is denoted by the costs of data requests. Instead of fetching all the latest data in each timestamp, we propose a novel ε-top-k query delivering approximate top-k answers with a probabilistic guarantee on the selectively-fetched dataset which is a combination of certain and uncertain data (modelled by their age). In addition, using a cloud environment as well as our proposed method to process ε-top-k queries can alleviate the computing-intensive computations, so it is not only cheaper but even faster than an ordinary top-k calculation method. The extensive experiments on the real-world climate datasets demonstrate that our methods can reduce the expense by more than half with desirable accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信