Efficient dynamic SKYCUBE computation in the Internet of Things
Zhenhua Huang, Yang Xiang, Dong Wang, Bo Zhang · 2010
Given a set of k-dimensional objects, the SKYCUBE computation returns a Skyline Cube which consists of skylines of all 2k−1 non-empty subspaces. This paper focuses on efficiently balancing the computation cost and update cost of dynamic Sky-Cube computation in the Internet of Things. We design an efficient grid-based algorithm ADSCIT (Algorithm for Dynamic SKYCUBE Computation in the Internet of Things) which includes two modules: (1) continuous maintenance module (CMM), which mainly incrementally update the non-pseudo objects; (2) progressive computation module (PCM), which can fast obtains the Skyline Cube from the updated non-pseudo objects. The detailed theoretical analyses and extensive experiments show that our solution is both efficient and effective.