An efficient scheme to completely avoid re-labeling in XML updates

Hye Kyeong Ko, Sang-Geun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

A number of labeling schemes have been designed to label element nodes such that the relationship between nodes can easily be determined by comparing their labels. However, the label update cost is high in present labeling schemes. These schemes must re-label existing nodes or re-calculate certain values when inserting an order-sensitive element. In this paper, a labeling scheme is proposed to support order-sensitive update, without re-labeling or re-calculation. In experimental results, the proposed scheme efficiently processes order-sensitive queries and updates.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages259-264
Number of pages6
Volume4255 LNCS
Publication statusPublished - 2006 Dec 11
Event7th International Conference on Web Information Systems Engineering, WISE 2006 - Wuhan, China
Duration: 2006 Oct 232006 Oct 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4255 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Conference on Web Information Systems Engineering, WISE 2006
CountryChina
CityWuhan
Period06/10/2306/10/26

Fingerprint

Labeling Scheme
XML
Labeling
Labels
Update
Costs and Cost Analysis
Vertex of a graph
Query
Calculate
Costs
Experimental Results

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Ko, H. K., & Lee, S-G. (2006). An efficient scheme to completely avoid re-labeling in XML updates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4255 LNCS, pp. 259-264). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4255 LNCS).

An efficient scheme to completely avoid re-labeling in XML updates. / Ko, Hye Kyeong; Lee, Sang-Geun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4255 LNCS 2006. p. 259-264 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4255 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ko, HK & Lee, S-G 2006, An efficient scheme to completely avoid re-labeling in XML updates. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4255 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4255 LNCS, pp. 259-264, 7th International Conference on Web Information Systems Engineering, WISE 2006, Wuhan, China, 06/10/23.
Ko HK, Lee S-G. An efficient scheme to completely avoid re-labeling in XML updates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4255 LNCS. 2006. p. 259-264. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ko, Hye Kyeong ; Lee, Sang-Geun. / An efficient scheme to completely avoid re-labeling in XML updates. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4255 LNCS 2006. pp. 259-264 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8c6f1b0cfb1946ce99cb9de161e8f2d3,
title = "An efficient scheme to completely avoid re-labeling in XML updates",
abstract = "A number of labeling schemes have been designed to label element nodes such that the relationship between nodes can easily be determined by comparing their labels. However, the label update cost is high in present labeling schemes. These schemes must re-label existing nodes or re-calculate certain values when inserting an order-sensitive element. In this paper, a labeling scheme is proposed to support order-sensitive update, without re-labeling or re-calculation. In experimental results, the proposed scheme efficiently processes order-sensitive queries and updates.",
author = "Ko, {Hye Kyeong} and Sang-Geun Lee",
year = "2006",
month = "12",
day = "11",
language = "English",
isbn = "3540481052",
volume = "4255 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "259--264",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An efficient scheme to completely avoid re-labeling in XML updates

AU - Ko, Hye Kyeong

AU - Lee, Sang-Geun

PY - 2006/12/11

Y1 - 2006/12/11

N2 - A number of labeling schemes have been designed to label element nodes such that the relationship between nodes can easily be determined by comparing their labels. However, the label update cost is high in present labeling schemes. These schemes must re-label existing nodes or re-calculate certain values when inserting an order-sensitive element. In this paper, a labeling scheme is proposed to support order-sensitive update, without re-labeling or re-calculation. In experimental results, the proposed scheme efficiently processes order-sensitive queries and updates.

AB - A number of labeling schemes have been designed to label element nodes such that the relationship between nodes can easily be determined by comparing their labels. However, the label update cost is high in present labeling schemes. These schemes must re-label existing nodes or re-calculate certain values when inserting an order-sensitive element. In this paper, a labeling scheme is proposed to support order-sensitive update, without re-labeling or re-calculation. In experimental results, the proposed scheme efficiently processes order-sensitive queries and updates.

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

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

M3 - Conference contribution

AN - SCOPUS:33845253188

SN - 3540481052

SN - 9783540481058

VL - 4255 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 259

EP - 264

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -