欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
Top-k支配查询算法返回前k个支配得分最高的数据对象,在多维数据查询中有效地限定了结果集的大小,但是无法直接应用于数据流查询中.文中使用网格索引结构在多维数据流下构建的top-k支配算法,采取动态创建网格,反向遍历一次求支配区点数,剪枝无效单元格等策略,提高了查询的效率.实验结果证明了该方法在多维数据流查询中的有效性.
英文摘要：
The top-k dominating query returns k data objects which dominate the highest number of objects, which effectively limits the result size in multi-dimensional data query. However, it cannot be applied to data streams query directly. Using the grid index structure,this paper builds a top-k dominating query model over multi-dimensional data streams. The model improves the query efficiency with the strategy of dynamic creation of grid, traversing the grid to get the points number in dominated region in reversed order and pruning invalid cells. Experiment results prove the validity of the method in multi-dimensional data stream query.
同期刊论文项目
同项目期刊论文
期刊信息
位置：