Towards Efficient Maintenance of Continuous MaxRS Query for Trajectories
Towards Efficient Maintenance of Continuous MaxRS Query for Trajectories
复制标题
DOI：
10.5441/002/edbt.2017.36
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Muhammed Mas-ud Hussain;Kazi Ashik Islam;Goce Trajcevski;Mohammed Eunus Ali
中科院分区：
文献类型：
--
作者：
Muhammed Mas-ud Hussain;Kazi Ashik Islam;Goce Trajcevski;Mohammed Eunus Ali
We address the problem of efficient maintenance of the answer to a new type of query: Continuous Maximizing RangeSum (Co-MaxRS) for moving objects trajectories. The traditional static/spatial MaxRS problem finds a location for placing the centroid of a given (axes-parallel) rectangle R so that the sum of the weights of the point-objects from a given set O inside the interior of R is maximized. However, moving objects continuously change their locations over time, so the MaxRS solution for a particular time instant need not be a solution at another time instant. In this paper, we devise the conditions under which a particular MaxRS solution may cease to be valid and a new optimal location for the query-rectangle R is needed. More specifically, we solve the problem of maintaining the trajectory of the centroid of R. In addition, we propose efficient pruning strategies (and corresponding data structures) to speed-up the process of maintaining the accuracy of the Co-MaxRS solution. We prove the correctness of our approach and present experimental evaluations over both real and synthetic datasets, demonstrating the benefits of the proposed methods.
