Effective Density Queries on ContinuouslyMoving Objects
Effective Density Queries on ContinuouslyMoving Objects
复制标题
DOI：
10.1109/icde.2006.179
复制
发表时间：
2006-04
期刊：
影响因子：
--
通讯作者：
Christian S. Jensen;D. Lin;B. Ooi;Rui Zhang
中科院分区：
文献类型：
--
作者：
Christian S. Jensen;D. Lin;B. Ooi;Rui Zhang
本文假设一个设置中的人口的对象不断移动的欧几里德平面。假设每个对象的位置是已知的，该位置被建模为从时间到点的线性函数。在此背景下，本文研究了密集区域的查询。特别是，本文定义了一个特定类型的密度查询所需的属性，然后提出了一个算法的有效计算密度查询。虽然该算法可以利用移动对象的当前和不久的将来的位置的任何现有的索引，Bx树被使用。本文报告了一个广泛的实证研究，这elancement的算法的性能特性。
This paper assumes a setting where a population of objects move continuously in the Euclidean plane. The position of each object, modeled as a linear function from time to points, is assumed known. In this setting, the paper studies the querying for dense regions. In particular, the paper defines a particular type of density query with desirable properties and then proceeds to propose an algorithm for the efficient computation of density queries. While the algorithm may exploit any existing index for the current and near-future positions of moving objects, the Bx-tree is used. The paper reports on an extensive empirical study, which elicits the performance properties of the algorithm.