An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling

Yongrui Qin; Weiwei Sun; Zhuoyao Zhang; Ping Yu

doi:10.1049/cp:20070260

An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling

Yongrui Qin, Weiwei Sun, Zhuoyao Zhang, Ping Yu

Fudan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

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.

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	https://doi.org/10.1049/cp:20070260
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	https://www.worldcat.org/title/wireless-mobile-and-sensor-networks-2007-ccwmsn-07-iet-conference-on-date-12-14-dec-2007/oclc/406459786

Access to Document

10.1049/cp:20070260Licence: Unspecified

Cite this

@inproceedings{873730b37ace4ce5a0089081f408e2a7,

title = "An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling",

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.",

keywords = "Document-split, On-demand broadcast scheduling, XML",

author = "Yongrui Qin and Weiwei Sun and Zhuoyao Zhang and Ping Yu",

year = "2007",

doi = "10.1049/cp:20070260",

language = "English",

isbn = "9780863418365",

series = "IET Conference Publications",

publisher = "IET",

number = "533 CP",

pages = "759--762",

booktitle = "2007 IET Conference on Wireless, Mobile and Sensor Networks (CCWMSN07)",

address = "United Kingdom",

edition = "533 CP",

note = "IET Conference on Wireless, Mobile and Sensor Networks 2007, CCWMSN'07 ; Conference date: 12-12-2007 Through 14-12-2007",

url = "https://www.worldcat.org/title/wireless-mobile-and-sensor-networks-2007-ccwmsn-07-iet-conference-on-date-12-14-dec-2007/oclc/406459786",

}

Qin, Y, Sun, W, Zhang, Z & Yu, P 2007, An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling. in 2007 IET Conference on Wireless, Mobile and Sensor Networks (CCWMSN07). 533 CP edn, IET Conference Publications, no. 533 CP, IET, pp. 759-762, IET Conference on Wireless, Mobile and Sensor Networks 2007, Shanghai, China, 12/12/07. https://doi.org/10.1049/cp:20070260

An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling. / Qin, Yongrui; Sun, Weiwei; Zhang, Zhuoyao et al.
2007 IET Conference on Wireless, Mobile and Sensor Networks (CCWMSN07). 533 CP. ed. IET, 2007. p. 759-762 (IET Conference Publications; No. 533 CP).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling

AU - Qin, Yongrui

AU - Sun, Weiwei

AU - Zhang, Zhuoyao

AU - Yu, Ping

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Document-split

KW - On-demand broadcast scheduling

KW - XML

UR - https://www.scopus.com/pages/publications/62549129906

UR - https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4786314

U2 - 10.1049/cp:20070260

DO - 10.1049/cp:20070260

M3 - Conference contribution

AN - SCOPUS:62549129906

SN - 9780863418365

T3 - IET Conference Publications

SP - 759

EP - 762

BT - 2007 IET Conference on Wireless, Mobile and Sensor Networks (CCWMSN07)

PB - IET

T2 - IET Conference on Wireless, Mobile and Sensor Networks 2007

Y2 - 12 December 2007 through 14 December 2007

ER -

An Efficient Document-Split Algorithm for On-Demand XML Data Broadcast Scheduling

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this