摘要
考虑关于范围查询的动态轮廓计算问题。基于范围查询将数据集中的点利用点与查询之间的"距离"特性进行转换,转换后的点可视为是一个以查询点为坐标原点的新空间中的数据点,利用现有的轮廓计算方法对转换后的数据集进行计算得到轮廓集合,以此为基础设计相应的算法来实现针对范围查询的动态轮廓的计算。利用网格索引和Z曲线结构设计多个剪枝策略降低算法的空间与时间复杂度。实验结果验证了算法的有效性以及在时间和空间上的效率。
This paper addresses the problem of computing dynamic contour with regard to range query. The points in data set are transformed based on range query using the characteristic of ＂distance＂ between the point and the query, and the transformed points are deemed as the data points in ＇the new space which takes the query points as their origins of the coordinate. The transformed data set is calculated by making use of existing contour calculation method for deriving the contour set, on this basis the corresponding algorithm is designed to achieve dynamic contour calculation for range query. The grid index and Z-order curve structure are employed to design the pruning strategies in order to reduce the complexities of space and time of the algorithm. Experiment results have verified the validity of the algorithm and the efficiency in time and space.
出处
《计算机应用与软件》
CSCD
2011年第11期218-221,227,共5页
Computer Applications and Software
基金
安徽省高校自然科学基金(KJ2010B234)
