A binary string approach for updates in dynamic ordered XML data

Hye Kyeong Ko, Sang-Geun Lee

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

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
Volume22
Issue number4
DOIs
Publication statusPublished - 2010 Apr 1

Fingerprint

XML
Labeling
Labels
Query processing
Costs

Keywords

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

ASJC Scopus subject areas

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

Cite this

A binary string approach for updates in dynamic ordered XML data. / Ko, Hye Kyeong; Lee, Sang-Geun.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 22, No. 4, 4840344, 01.04.2010, p. 602-607.

Research output: Contribution to journalArticle

@article{d6832b31605c4e09afccf3137fc9d3e9,
title = "A binary string approach for updates in dynamic ordered XML data",
abstract = "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.",
keywords = "Dynamic XML update, Order-sensitive XML update, Reuse of deleted label, String",
author = "Ko, {Hye Kyeong} and Sang-Geun Lee",
year = "2010",
month = "4",
day = "1",
doi = "10.1109/TKDE.2009.87",
language = "English",
volume = "22",
pages = "602--607",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - A binary string approach for updates in dynamic ordered XML data

AU - Ko, Hye Kyeong

AU - Lee, Sang-Geun

PY - 2010/4/1

Y1 - 2010/4/1

N2 - 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.

AB - 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.

KW - Dynamic XML update

KW - Order-sensitive XML update

KW - Reuse of deleted label

KW - String

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

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

U2 - 10.1109/TKDE.2009.87

DO - 10.1109/TKDE.2009.87

M3 - Article

AN - SCOPUS:77649257848

VL - 22

SP - 602

EP - 607

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 4

M1 - 4840344

ER -