Query Recombination: To Process a Large Number of Concurrent Top-k Queries towards IoT Data on an Edge Server

Tuo Shi, Zhipeng Cai, Yingshu Li
{"title":"Query Recombination: To Process a Large Number of Concurrent Top-k Queries towards IoT Data on an Edge Server","authors":"Tuo Shi, Zhipeng Cai, Yingshu Li","doi":"10.1109/ICDCS54860.2022.00060","DOIUrl":null,"url":null,"abstract":"Multi-access Edge Computing is an important technique in the Internet of Things (IoT). It can help people observe the physical world by caching IoT data at an edge server and provide data query services. In this paper, we investigate how to process numerous concurrent top-k queries on an edge server. Since the computation resource of an edge server is limited and costly, processing concurrent top-k queries in the edge is totally different from that in the cloud. Researchers always focus on reducing time/space complexity of processing single top-k query in the cloud. However, how to process numerous top-k queries on an edge server in a cost-efficient manner still remains an open problem. In order to solve the problem, we propose the query recombination concept which aims at using the correlation of queries to reduce resource consumption of query processing. By adopting query recombination, we can make use of a small set of queries to answer the other queries and reduce resource consumption as well. We prove that constructing an optimal query recombination is NP-hard. Three approximate algorithms are proposed accordingly. Simulations are carried out to evaluate the performance of the proposed algorithms further, and the results show that the proposed algorithms are effective and efficient.","PeriodicalId":225883,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS54860.2022.00060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Multi-access Edge Computing is an important technique in the Internet of Things (IoT). It can help people observe the physical world by caching IoT data at an edge server and provide data query services. In this paper, we investigate how to process numerous concurrent top-k queries on an edge server. Since the computation resource of an edge server is limited and costly, processing concurrent top-k queries in the edge is totally different from that in the cloud. Researchers always focus on reducing time/space complexity of processing single top-k query in the cloud. However, how to process numerous top-k queries on an edge server in a cost-efficient manner still remains an open problem. In order to solve the problem, we propose the query recombination concept which aims at using the correlation of queries to reduce resource consumption of query processing. By adopting query recombination, we can make use of a small set of queries to answer the other queries and reduce resource consumption as well. We prove that constructing an optimal query recombination is NP-hard. Three approximate algorithms are proposed accordingly. Simulations are carried out to evaluate the performance of the proposed algorithms further, and the results show that the proposed algorithms are effective and efficient.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
查询重组:在边缘服务器上处理大量并发的对IoT数据的Top-k查询
多址边缘计算是物联网中的一项重要技术。它可以通过在边缘服务器上缓存物联网数据来帮助人们观察物理世界,并提供数据查询服务。在本文中,我们研究了如何在边缘服务器上处理大量并发top-k查询。由于边缘服务器的计算资源有限且成本高昂,因此在边缘处理并发top-k查询与在云中处理查询完全不同。研究人员一直关注如何降低在云中处理单个top-k查询的时间/空间复杂度。然而,如何以经济高效的方式在边缘服务器上处理大量top-k查询仍然是一个悬而未决的问题。为了解决这个问题,我们提出了查询重组的概念,旨在利用查询之间的相关性来减少查询处理的资源消耗。通过采用查询重组,我们可以利用一小部分查询来回答其他查询,并减少资源消耗。我们证明了构造最优查询重组是np困难的。据此提出了三种近似算法。通过仿真进一步验证了所提算法的性能,结果表明所提算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Nezha: Exploiting Concurrency for Transaction Processing in DAG-based Blockchains Toward Cleansing Backdoored Neural Networks in Federated Learning Themis: An Equal, Unpredictable, and Scalable Consensus for Consortium Blockchain IoDSCF: A Store-Carry-Forward Routing Protocol for joint Bus Networks and Internet of Drones FlowValve: Packet Scheduling Offloaded on NP-based SmartNICs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1