Abstract

Max and Min are two important aggregates in the Data Stream Management System (DSMS). A novel mechanism called the exemplary sketch was proposed to evaluate Max and Min over sliding windows with various sizes in the real time data stream environment. With this method we no longer need to buffer all the tuples to fall into current sliding windows, which means we can reduce the space cost remarkably. Because of this, the processing time can also be reduced dramatically. Experimental results show that the sketch scheme yields very good performance on both space and time cost.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.