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-selectivity1 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.
| Original language | English |
|---|---|
| Title of host publication | 2007 IET Conference on Wireless, Mobile and Sensor Networks (CCWMSN07) |
| Publisher | IET |
| Pages | 759-762 |
| Number of pages | 4 |
| Edition | 533 CP |
| ISBN (Print) | 9780863418365 |
| DOIs | |
| Publication status | Published - 2007 |
| Externally published | Yes |
| Event | IET Conference on Wireless, Mobile and Sensor Networks 2007 - Shanghai, China Duration: 12 Dec 2007 → 14 Dec 2007 https://www.worldcat.org/title/wireless-mobile-and-sensor-networks-2007-ccwmsn-07-iet-conference-on-date-12-14-dec-2007/oclc/406459786 |
Publication series
| Name | IET Conference Publications |
|---|---|
| Publisher | IET |
| Number | 533 CP |
| ISSN (Print) | 0537-9989 |
Conference
| Conference | IET Conference on Wireless, Mobile and Sensor Networks 2007 |
|---|---|
| Abbreviated title | CCWMSN'07 |
| Country/Territory | China |
| City | Shanghai |
| Period | 12/12/07 → 14/12/07 |
| Internet address |