Abstract

Most recent applications such as sensor networks generate continuous data streams. Additional constraints are faced for efficient query processing of such data streams that have uncertain nature and require fast and timely processing. Traditional query processing techniques of static data process the whole data without partitioning them, which is not applicable to data streams. Applying data clustering is demanded as a preprocessing step of data streams. Thus, in this paper, we propose the Incomplete High dimensional Data streams Query processing (IHDQ) algorithm for efficiently answering data streams queries. Obtained results reveal the efficiency of clustering and query processing of the proposed IHDQ compared to the alternative state-of-the-art approaches.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call