Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments

Yongrui Qin; Hua Wang; Jitian Xiao

Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments

Yongrui Qin, Hua Wang, Jitian Xiao

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

Abstract

The organization of data on wireless channels, which aims to reduce the access time of mobile clients, is a key problem in data broadcasts. Many scheduling algorithms have been designed to organize flat data on air. However, how to effectively schedule semi-structured information such as XML data on wireless channels is still a challenge. In this paper, we firstly propose a novel method to greatly reduce the tuning time by splitting query results into XML snippets and to achieve better access efficiency by combining similar ones. Then we analyze the data broadcast scheduling problem of on-demand XML data broadcasts and define the efficiency of a data item. Based on the definition, a Least Efficient Last (LEL) scheduling algorithm is also devised to effectively organize XML data on wireless channels. Finally, we study the performance of our algorithms through extensive experiments. The results show that our scheduling algorithms can reduce both access time and tuning time significantly when compared with existing work.

Original language	English
Title of host publication	Proceedings of the Twenty-Second Australasian Database Conference
Subtitle of host publication	ADC '11
Editors	Heng Tao Shen, Yanchun Zhang
Publisher	Australian Computer Society
Pages	95-102
Number of pages	8
Volume	115
ISBN (Print)	9781920682958
Publication status	Published - 1 Jan 2011
Externally published	Yes
Event	22nd Australasian Database Conference - Perth, Australia Duration: 17 Jan 2011 → 20 Jan 2011 Conference number: 22 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=10250&copyownerid=3475

Publication series

Name	Conferences in Research and Practice in Information Technology Series
Publisher	Australian Computer Society
ISSN (Print)	1445-1336

Conference

Conference	22nd Australasian Database Conference
Abbreviated title	ADC 2011
Country/Territory	Australia
City	Perth
Period	17/01/11 → 20/01/11
Internet address	http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=10250&copyownerid=3475

Access to Document

https://dl.acm.org/doi/10.5555/2460396.2460409Licence: Unspecified

Cite this

Qin, Y., Wang, H., & Xiao, J. (2011). Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments. In H. T. Shen, & Y. Zhang (Eds.), Proceedings of the Twenty-Second Australasian Database Conference: ADC '11 (Vol. 115, pp. 95-102). (Conferences in Research and Practice in Information Technology Series). Australian Computer Society. https://dl.acm.org/doi/10.5555/2460396.2460409

Qin, Yongrui ; Wang, Hua ; Xiao, Jitian. / Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments. Proceedings of the Twenty-Second Australasian Database Conference: ADC '11. editor / Heng Tao Shen ; Yanchun Zhang. Vol. 115 Australian Computer Society, 2011. pp. 95-102 (Conferences in Research and Practice in Information Technology Series).

@inproceedings{eb642ada3bfc48d7a55602505f270da8,

title = "Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments",

abstract = "The organization of data on wireless channels, which aims to reduce the access time of mobile clients, is a key problem in data broadcasts. Many scheduling algorithms have been designed to organize flat data on air. However, how to effectively schedule semi-structured information such as XML data on wireless channels is still a challenge. In this paper, we firstly propose a novel method to greatly reduce the tuning time by splitting query results into XML snippets and to achieve better access efficiency by combining similar ones. Then we analyze the data broadcast scheduling problem of on-demand XML data broadcasts and define the efficiency of a data item. Based on the definition, a Least Efficient Last (LEL) scheduling algorithm is also devised to effectively organize XML data on wireless channels. Finally, we study the performance of our algorithms through extensive experiments. The results show that our scheduling algorithms can reduce both access time and tuning time significantly when compared with existing work.",

keywords = "Data broadcast, Multi-item, On-demand, Scheduling algorithm, Wireless environment, XML",

author = "Yongrui Qin and Hua Wang and Jitian Xiao",

year = "2011",

month = jan,

day = "1",

language = "English",

isbn = "9781920682958",

volume = "115",

series = "Conferences in Research and Practice in Information Technology Series",

publisher = "Australian Computer Society",

pages = "95--102",

editor = "Shen, {Heng Tao} and Yanchun Zhang",

booktitle = "Proceedings of the Twenty-Second Australasian Database Conference",

address = "Australia",

note = "22nd Australasian Database Conference, ADC 2011 ; Conference date: 17-01-2011 Through 20-01-2011",

url = "http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=10250&copyownerid=3475",

}

Qin, Y, Wang, H & Xiao, J 2011, Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments. in HT Shen & Y Zhang (eds), Proceedings of the Twenty-Second Australasian Database Conference: ADC '11. vol. 115, Conferences in Research and Practice in Information Technology Series, Australian Computer Society, pp. 95-102, 22nd Australasian Database Conference, Perth, Western Australia, Australia, 17/01/11. <https://dl.acm.org/doi/10.5555/2460396.2460409>

Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments. / Qin, Yongrui; Wang, Hua; Xiao, Jitian.

Proceedings of the Twenty-Second Australasian Database Conference: ADC '11. ed. / Heng Tao Shen; Yanchun Zhang. Vol. 115 Australian Computer Society, 2011. p. 95-102 (Conferences in Research and Practice in Information Technology Series).

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

TY - GEN

T1 - Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments

AU - Qin, Yongrui

AU - Wang, Hua

AU - Xiao, Jitian

N1 - Conference code: 22

PY - 2011/1/1

Y1 - 2011/1/1

N2 - The organization of data on wireless channels, which aims to reduce the access time of mobile clients, is a key problem in data broadcasts. Many scheduling algorithms have been designed to organize flat data on air. However, how to effectively schedule semi-structured information such as XML data on wireless channels is still a challenge. In this paper, we firstly propose a novel method to greatly reduce the tuning time by splitting query results into XML snippets and to achieve better access efficiency by combining similar ones. Then we analyze the data broadcast scheduling problem of on-demand XML data broadcasts and define the efficiency of a data item. Based on the definition, a Least Efficient Last (LEL) scheduling algorithm is also devised to effectively organize XML data on wireless channels. Finally, we study the performance of our algorithms through extensive experiments. The results show that our scheduling algorithms can reduce both access time and tuning time significantly when compared with existing work.

AB - The organization of data on wireless channels, which aims to reduce the access time of mobile clients, is a key problem in data broadcasts. Many scheduling algorithms have been designed to organize flat data on air. However, how to effectively schedule semi-structured information such as XML data on wireless channels is still a challenge. In this paper, we firstly propose a novel method to greatly reduce the tuning time by splitting query results into XML snippets and to achieve better access efficiency by combining similar ones. Then we analyze the data broadcast scheduling problem of on-demand XML data broadcasts and define the efficiency of a data item. Based on the definition, a Least Efficient Last (LEL) scheduling algorithm is also devised to effectively organize XML data on wireless channels. Finally, we study the performance of our algorithms through extensive experiments. The results show that our scheduling algorithms can reduce both access time and tuning time significantly when compared with existing work.

KW - Data broadcast

KW - Multi-item

KW - On-demand

KW - Scheduling algorithm

KW - Wireless environment

KW - XML

UR - http://www.scopus.com/inward/record.url?scp=84873457561&partnerID=8YFLogxK

UR - https://crpit.scem.westernsydney.edu.au/Vol115.html

M3 - Conference contribution

AN - SCOPUS:84873457561

SN - 9781920682958

VL - 115

T3 - Conferences in Research and Practice in Information Technology Series

SP - 95

EP - 102

BT - Proceedings of the Twenty-Second Australasian Database Conference

A2 - Shen, Heng Tao

A2 - Zhang, Yanchun

PB - Australian Computer Society

T2 - 22nd Australasian Database Conference

Y2 - 17 January 2011 through 20 January 2011

ER -

Effective Scheduling Algorithm for On-Demand XML Data Broadcasts in Wireless Environments

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this