Abstract
XML data broadcast is attracting more and more interests from many researchers. In on-demand XML data broadcast, the existing broadcast scheduling methods usually only considered the document-selectivity of user requests. In this paper, we propose an efficient document-split algorithm which considers the branch-selectivity for on-demand XML data broadcast scheduling. First, we divide the user requests into two sets according to the branch-selectivity; then split every document into two parts according to these two sets. With our scheduling algorithm, the hot and small branches are broadcast first. User requests with low branch-selectivity can be satisfied in a shorter time and both of access time and tuning time are reduced. Experiments show that our algorithm provides significantly better performance when compared with existing scheduling algorithms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
