Study on Top-k Dominating Query Algorithm over Multi-dimensional Data Streams

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.