Please use this identifier to cite or link to this item: https://doi.org/10.1109/TKDE.2010.221
DC FieldValue
dc.titleLabeling dynamic XML documents: An order-centric approach
dc.contributor.authorXu, L.
dc.contributor.authorLing, T.W.
dc.contributor.authorWu, H.
dc.date.accessioned2013-07-04T07:47:38Z
dc.date.available2013-07-04T07:47:38Z
dc.date.issued2012
dc.identifier.citationXu, L., Ling, T.W., Wu, H. (2012). Labeling dynamic XML documents: An order-centric approach. IEEE Transactions on Knowledge and Data Engineering 24 (1) : 100-113. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2010.221
dc.identifier.issn10414347
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39703
dc.description.abstractDynamic XML labeling schemes have important applications in XML Database Management Systems. In this paper, we explore dynamic XML labeling schemes from a novel order-centric perspective. We compare the various labeling schemes proposed in the literature with a special focus on their orders of labels. We show that the order of labels fundamentally impacts the update performance of a labeling scheme and develop an order-based framework to classify and characterize XML labeling schemes. Although there are dynamic XML labeling schemes that can completely avoid relabeling, the gain in update performance all come with considerable costs such as larger label size and lower query performance, even if the XML documents are hardly updated. We introduce vector order which is the foundation of the dynamic labeling schemes we propose. Compared with previous solutions that are based on natural order or lexicographical order, vector order is a simple, yet most effective solution to process updates in XML DBMS. We show that vector order can be gracefully applied to both range-based and prefix-based labeling schemes with little overhead introduced. Moreover, vector order-based labeling schemes are not only efficient to process, but also resilient to skewed insertions. Qualitative and experimental evaluations confirm the benefits of our approach compared to previous solutions. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TKDE.2010.221
dc.sourceScopus
dc.subjectquery processing
dc.subjectTree node labeling
dc.subjectupdate processing
dc.subjectXML data management
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/TKDE.2010.221
dc.description.sourcetitleIEEE Transactions on Knowledge and Data Engineering
dc.description.volume24
dc.description.issue1
dc.description.page100-113
dc.description.codenITKEE
dc.identifier.isiut000297357100008
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

14
checked on Mar 31, 2020

WEB OF SCIENCETM
Citations

8
checked on Mar 24, 2020

Page view(s)

124
checked on Mar 31, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.