A binary string approach for updates in dynamic ordered XML data

Hye Kyeong Ko, Sang-Geun Lee

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)


To facilitate XML query processing, several labeling schemes have been proposed, in which the ancestor-descendant and parent-child relationships in XML queries can be quickly determined without accessing the original XML file. However, all of these existing schemes have to relabel the existing nodes or recalculate certain values when order-sensitive updates cause insertions, thus causing the label update cost to be high. In this paper, we propose a novel labeling scheme, called IBSL (Improved Binary String Labeling), which supports order-sensitive updates without relabeling or recalculation. In addition, we reuse the deleted labels at the same position in the XML tree. The conducted experimental results show that IBSL efficiently processes order-sensitive queries and leaf node/subtree updates.

Original languageEnglish
Article number4840344
Pages (from-to)602-607
Number of pages6
JournalIEEE Transactions on Knowledge and Data Engineering
Issue number4
Publication statusPublished - 2010 Apr


  • Dynamic XML update
  • Order-sensitive XML update
  • Reuse of deleted label
  • String

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'A binary string approach for updates in dynamic ordered XML data'. Together they form a unique fingerprint.

Cite this