ReLab: a subtree based labeling scheme for efficient XML query processing

Samini Subramaniam; Su Cheng Haw; Lay Ki Soon

doi:10.1109/ISTT.2014.7238189

ReLab: a subtree based labeling scheme for efficient XML query processing

Samini Subramaniam, Su Cheng Haw, Lay Ki Soon

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

9 Citations (Scopus)

Abstract

XML has become the de facto standard in the real world application over the WWW. Thus, data or query processing is critical to ensure speed response time to cater user queries. Response time is often influenced by the complexity of labeling scheme which is not only used for unique identification of XML nodes, but for structural relationship purpose as well. The labeling scheme adopted is vital to ensure query processing is done flawlessly and promptly. In this paper, we introduce ReLab, a subtree based labeling scheme which generates labels using depth-first traversal. Our experimental evaluation indicated that ReLab outperformed Dietz and region numbering schemes in terms of time taken to generate labels for each XML nodes.

Original language	English
Title of host publication	ISTT 2014 - 2014 IEEE 2nd International Symposium on Telecommunication Technologies
Editors	Mahamod Ismail, Nordin Ramli
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	121-125
Number of pages	5
ISBN (Electronic)	9781479959822
DOIs	https://doi.org/10.1109/ISTT.2014.7238189
Publication status	Published - 2 Sept 2015
Externally published	Yes
Event	IEEE International Symposium on Telecommunication Technologies 2014 - Langkawi Lagoon Resort, Langkawi, Malaysia Duration: 24 Nov 2014 → 26 Nov 2014 Conference number: 2nd http://istt2014.comvt.org/ https://ieeexplore.ieee.org/xpl/conhome/7209076/proceeding (Proceedings)

Conference

Conference	IEEE International Symposium on Telecommunication Technologies 2014
Abbreviated title	ISTT 2014
Country/Territory	Malaysia
City	Langkawi
Period	24/11/14 → 26/11/14
Internet address	http://istt2014.comvt.org/ https://ieeexplore.ieee.org/xpl/conhome/7209076/proceeding (Proceedings)

Keywords

labeling scheme
structural query processing
subtree labeling
XML

Access to Document

10.1109/ISTT.2014.7238189

Cite this

@inproceedings{4650a56c707b4fdaa869daabd3c70d0b,

title = "ReLab: a subtree based labeling scheme for efficient XML query processing",

abstract = "XML has become the de facto standard in the real world application over the WWW. Thus, data or query processing is critical to ensure speed response time to cater user queries. Response time is often influenced by the complexity of labeling scheme which is not only used for unique identification of XML nodes, but for structural relationship purpose as well. The labeling scheme adopted is vital to ensure query processing is done flawlessly and promptly. In this paper, we introduce ReLab, a subtree based labeling scheme which generates labels using depth-first traversal. Our experimental evaluation indicated that ReLab outperformed Dietz and region numbering schemes in terms of time taken to generate labels for each XML nodes.",

keywords = "labeling scheme, structural query processing, subtree labeling, XML",

author = "Samini Subramaniam and Haw, {Su Cheng} and Soon, {Lay Ki}",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE. Copyright: Copyright 2015 Elsevier B.V., All rights reserved.; IEEE International Symposium on Telecommunication Technologies 2014, ISTT 2014 ; Conference date: 24-11-2014 Through 26-11-2014",

year = "2015",

month = sep,

day = "2",

doi = "10.1109/ISTT.2014.7238189",

language = "English",

pages = "121--125",

editor = "Mahamod Ismail and Nordin Ramli",

booktitle = "ISTT 2014 - 2014 IEEE 2nd International Symposium on Telecommunication Technologies",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States of America",

url = "http://istt2014.comvt.org/, https://ieeexplore.ieee.org/xpl/conhome/7209076/proceeding",

}

Subramaniam, S, Haw, SC & Soon, LK 2015, ReLab: a subtree based labeling scheme for efficient XML query processing. in M Ismail & N Ramli (eds), ISTT 2014 - 2014 IEEE 2nd International Symposium on Telecommunication Technologies. IEEE, Institute of Electrical and Electronics Engineers, pp. 121-125, IEEE International Symposium on Telecommunication Technologies 2014, Langkawi, Malaysia, 24/11/14. https://doi.org/10.1109/ISTT.2014.7238189

ReLab: a subtree based labeling scheme for efficient XML query processing. / Subramaniam, Samini; Haw, Su Cheng; Soon, Lay Ki.
ISTT 2014 - 2014 IEEE 2nd International Symposium on Telecommunication Technologies. ed. / Mahamod Ismail; Nordin Ramli. IEEE, Institute of Electrical and Electronics Engineers, 2015. p. 121-125.

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

TY - GEN

T1 - ReLab

T2 - IEEE International Symposium on Telecommunication Technologies 2014

AU - Subramaniam, Samini

AU - Haw, Su Cheng

AU - Soon, Lay Ki

N1 - Conference code: 2nd

PY - 2015/9/2

Y1 - 2015/9/2

N2 - XML has become the de facto standard in the real world application over the WWW. Thus, data or query processing is critical to ensure speed response time to cater user queries. Response time is often influenced by the complexity of labeling scheme which is not only used for unique identification of XML nodes, but for structural relationship purpose as well. The labeling scheme adopted is vital to ensure query processing is done flawlessly and promptly. In this paper, we introduce ReLab, a subtree based labeling scheme which generates labels using depth-first traversal. Our experimental evaluation indicated that ReLab outperformed Dietz and region numbering schemes in terms of time taken to generate labels for each XML nodes.

AB - XML has become the de facto standard in the real world application over the WWW. Thus, data or query processing is critical to ensure speed response time to cater user queries. Response time is often influenced by the complexity of labeling scheme which is not only used for unique identification of XML nodes, but for structural relationship purpose as well. The labeling scheme adopted is vital to ensure query processing is done flawlessly and promptly. In this paper, we introduce ReLab, a subtree based labeling scheme which generates labels using depth-first traversal. Our experimental evaluation indicated that ReLab outperformed Dietz and region numbering schemes in terms of time taken to generate labels for each XML nodes.

KW - labeling scheme

KW - structural query processing

KW - subtree labeling

KW - XML

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

U2 - 10.1109/ISTT.2014.7238189

DO - 10.1109/ISTT.2014.7238189

M3 - Conference Paper

AN - SCOPUS:84946543960

SP - 121

EP - 125

BT - ISTT 2014 - 2014 IEEE 2nd International Symposium on Telecommunication Technologies

A2 - Ismail, Mahamod

A2 - Ramli, Nordin

PB - IEEE, Institute of Electrical and Electronics Engineers

Y2 - 24 November 2014 through 26 November 2014

ER -

ReLab: a subtree based labeling scheme for efficient XML query processing

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this