Efficient indexing multiple multidimensional continuous queries over data stream

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.