寻找移动范围查询的安全区域

Haidar AL-Khalidi, David Taniar, John Betts, Sultan Alamri
{"title":"寻找移动范围查询的安全区域","authors":"Haidar AL-Khalidi,&nbsp;David Taniar,&nbsp;John Betts,&nbsp;Sultan Alamri","doi":"10.1016/j.mcm.2012.11.023","DOIUrl":null,"url":null,"abstract":"<div><p>The cost of monitoring and keeping the location of a Moving Query updated is very high, as the calculation of the range query needs to be re-evaluated whenever the query moves. Many methods have been proposed to minimize the computation and communication costs for the continuous monitoring of Moving Range Queries. However, because this problem has been only partly solved, more radical efforts are needed. In response, we propose an efficient technique by adopting the concept of a safe region. The safe region is an area where the set of objects of interest does not change. If a moving query is roaming within the safe region then there is no need to update the query. This paper presents efficient techniques to create a competent safe region to reduce the communication costs. We use <em>Monte-Carlo</em> simulation to calculate the area of the safe region due to the irregularity of its shape. As long as the query remains inside its specified safe region, expensive re-computation is not required, which reduces the computational and communication costs in client–server architectures.</p></div>","PeriodicalId":49872,"journal":{"name":"Mathematical and Computer Modelling","volume":"58 5","pages":"Pages 1449-1458"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.mcm.2012.11.023","citationCount":"26","resultStr":"{\"title\":\"On finding safe regions for moving range queries\",\"authors\":\"Haidar AL-Khalidi,&nbsp;David Taniar,&nbsp;John Betts,&nbsp;Sultan Alamri\",\"doi\":\"10.1016/j.mcm.2012.11.023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The cost of monitoring and keeping the location of a Moving Query updated is very high, as the calculation of the range query needs to be re-evaluated whenever the query moves. Many methods have been proposed to minimize the computation and communication costs for the continuous monitoring of Moving Range Queries. However, because this problem has been only partly solved, more radical efforts are needed. In response, we propose an efficient technique by adopting the concept of a safe region. The safe region is an area where the set of objects of interest does not change. If a moving query is roaming within the safe region then there is no need to update the query. This paper presents efficient techniques to create a competent safe region to reduce the communication costs. We use <em>Monte-Carlo</em> simulation to calculate the area of the safe region due to the irregularity of its shape. As long as the query remains inside its specified safe region, expensive re-computation is not required, which reduces the computational and communication costs in client–server architectures.</p></div>\",\"PeriodicalId\":49872,\"journal\":{\"name\":\"Mathematical and Computer Modelling\",\"volume\":\"58 5\",\"pages\":\"Pages 1449-1458\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.mcm.2012.11.023\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical and Computer Modelling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0895717712003342\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical and Computer Modelling","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0895717712003342","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

监视和保持移动查询位置更新的成本非常高,因为每当查询移动时都需要重新评估范围查询的计算。为了实现对移动距离查询的连续监测,已经提出了许多最小化计算和通信开销的方法。然而,由于这一问题只得到部分解决,因此需要作出更彻底的努力。为此,我们提出了一种采用安全区域概念的有效技术。安全区域是一个感兴趣的对象集合不会改变的区域。如果移动查询在安全区域内漫游,则不需要更新查询。本文提出了建立有效安全区域以降低通信成本的有效技术。我们使用蒙特卡罗模拟计算了由于其形状不规则而产生的安全区域的面积。只要查询保持在其指定的安全区域内,就不需要昂贵的重新计算,这减少了客户机-服务器体系结构中的计算和通信成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On finding safe regions for moving range queries

The cost of monitoring and keeping the location of a Moving Query updated is very high, as the calculation of the range query needs to be re-evaluated whenever the query moves. Many methods have been proposed to minimize the computation and communication costs for the continuous monitoring of Moving Range Queries. However, because this problem has been only partly solved, more radical efforts are needed. In response, we propose an efficient technique by adopting the concept of a safe region. The safe region is an area where the set of objects of interest does not change. If a moving query is roaming within the safe region then there is no need to update the query. This paper presents efficient techniques to create a competent safe region to reduce the communication costs. We use Monte-Carlo simulation to calculate the area of the safe region due to the irregularity of its shape. As long as the query remains inside its specified safe region, expensive re-computation is not required, which reduces the computational and communication costs in client–server architectures.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical and Computer Modelling
Mathematical and Computer Modelling 数学-计算机:跨学科应用
自引率
0.00%
发文量
0
审稿时长
9.5 months
×
引用
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学术官方微信