Abstract

The notion of update pattern awareness in the context of continuous queries over relations, streams and sliding windows was introduced in previous reseaches. This investigation concerns the access costs of data structures for the intermediate results or final results of continuous query processing over sliding windows by update pattern awareness.The ladder structure was employed to store intermediate results or final results and the trunk list and the branch list were designed into ladder structure. The branch lists were used to gather the result tuples with the identical expiration time , when the result tuples expired through the three components of the ladder structure. Our experiments show that the new data structure outperforms the partioned structure(calendar queue) and other data structures by an order of magnitude.

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.