By Topic

Efficient indexing multiple multidimensional continuous queries over data stream

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dongfeng Hou ; Key Lab. of Sci. & Technol. for Nat. Defense of C4ISR Technol., Nat. Univ. of Defense Technol., Changsha, China ; Qingbao Liu ; Changhui Lu ; Weiming Zhang

The continuous query is the very common form in the applications of data stream. For the infinity of data stream, the semantics of multidimensional continuous query based on time window is defined in this paper. The ultimate results are continuous computed on the state of queries with arriving of new tuple. There are a voluminous number of continuous queries registered in system, so it is difficult to update the states of all queries. Partition based index tree is proposed for indexing multiple queries. When new tuple arrived, the set of queries which is affected by it can be compute quickly through the index tree, and the state of queries could be updated in real time. The results of experiments indicate that the method is efficient and efficiency for computing of multidimensional continuous queries.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:6 )

Date of Conference:

9-11 July 2010