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 publicationWeb Information Systems - WISE 2006
Subtitle of host publication7th International Conference on Web Information Systems Engineering, Proceedings
PublisherSpringer Verlag
Pages259-264
Number of pages6
ISBN (Print)3540481052, 9783540481058
DOIs
Publication statusPublished - 2006
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)0302-9743
ISSN (Electronic)1611-3349

Other

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An efficient scheme to completely avoid re-labeling in XML updates'. Together they form a unique fingerprint.

Cite this