Issue No. 03 - March (2015 vol. 26)
Ze Deng , School of Computer Science, China University of Geosciences, Wuhan 430074, China
Xiaomin Wu , School of Computer Science, China University of Geosciences, Wuhan 430074, China
Lizhe Wang , School of Computer Science, China University of Geosciences, Wuhan 430074, China
Xiaodao Chen , School of Computer Science, China University of Geosciences, Wuhan 430074, China
Rajiv Ranjan , ICT Centre, CSIRO , Australia,
Albert Zomaya , School of Information Technologies , The University of Sydney, Sydney, Australia
Dan Chen , School of Computer Science, China University of Geosciences, Wuhan 430074, China
More and more real-time applications need to handle dynamic continuous queries over streaming data of high density. Conventional data and query indexing approaches generally do not apply for excessive costs in either maintenance or space. Aiming at these problems, this study first proposes a new indexing structure by fusing an adaptive cell and KDB-tree, namely CKDB-tree. A cell-tree indexing approach has been developed on the basis of the CKDB-tree that supports dynamic continuous queries. The approach significantly reduces the space costs and scales well with the increasing data size. Towards providing a scalable solution to filtering massive steaming data, this study has explored the feasibility to utilize the contemporary general-purpose computing on the graphics processing unit (GPGPU). The CKDB-tree-based approach has been extended to operate on both the CPU (host) and the GPU (device). The GPGPU-aided approach performs query indexing on the host while perform streaming data filtering on the device in a massively parallel manner. The two heterogeneous tasks execute in parallel and the latency of streaming data transfer between the host and the device is hidden. The experimental results indicate that (1) CKDB-tree can reduce the space cost comparing to the cell-based indexing structure by 60 percent on average, (2) the approach upon the CKDB-tree outperforms the traditional counterparts upon the KDB-tree by 66, 75 and 79 percent in average for uniform, skewed and hyper-skewed data in terms of update costs, and (3) the GPGPU-aided approach greatly improves the approach upon the CKDB-tree with the support of only a single Kepler GPU, and it provides real-time filtering of streaming data with 2.5M data tuples per second. The massively parallel computing technology exhibits great potentials in streaming data monitoring.
Indexing, Graphics processing units, Monitoring, Maintenance engineering, Computer architecture, Real-time systems
Z. Deng et al., "Parallel Processing of Dynamic Continuous Queries over Streaming Data Flows," in IEEE Transactions on Parallel & Distributed Systems, vol. 26, no. 3, pp. 834-846, 2015.