Most efficient indeces and query techniques over XML (extensible markup language) data are based on a certain labeling scheme, which can quickly determine ancestor-descendant and parent-child relationship between two nodes. The current basic labeling schemes such as containment scheme and prefix scheme cannot avoid relabeling when XML documents are updated. After analyzing the essence of existing dynamic XML labels such as compact dynamic binary string (CDBS) and vector encoding, this paper gives a common unifying framework for the numeric-based generalized dynamic label, which can be implemented into a variety of dynamic labels according to the different user-defined value comparison methods. This paper also proposes a novel dynamic labeling scheme called radical sign label. Extensive experiments show that the radical sign label performs well for the initialization, insertion and query operations, and especially for skewed insertion where the storage cost of the radical sign label is better than that of former methods.
NI Ye-feng (倪叶峰), FAN Yuan-chao (范远超), TAN Xin-cheng (谈昕澄) CUI Jin (崔锦), WANG Xiao-ling (王晓玲)
. Numeric-Based XML Labeling Schema by Generalized Dynamic Method[J]. Journal of Shanghai Jiaotong University(Science), 2012
, 17(2)
: 203
-208
.
DOI: 10.1007/s12204-012-1253-5
[1] Zhang C, Naughton J, Dewitt D, et al. On supporting containment queries in relational database management systems [C]// Proceedings of the 27th
ACM SIGMOD International Conference on Management of Data. New York, USA: ACM, 2001: 425-436.
[2] Dietz P F. Maintaining order in a linked list [C]//Proceedings of the 14th Annual ACM Symposium on Theory of Computing. New York, USA: ACM, 1982:
122-127.
[3] Kha D D, Yoshikawa M, Uemura S. An XML indexing structure with relative region coordinate[C]//Proceedings of the 17th International Conference
on Data Engineering. Washington, DC, USA: IEEE,2001: 313-324.
[4] Tatarinov I, Viglas S D, Beyer K, et al. Storing and querying ordered XML using a relational database system [C]//Proceedings of the 28th ACM
SIGMOD International Conference on Management of Data. New York, USA: ACM, 2002: 204-215.
[5] Yu J X, Luo D, Meng X, et al. Dynamically updating XML data: Numbering scheme revisited [J]. Journal of World Wild Web, 2005, 8(1): 5-26.
[6] Wang W, Jiang H, Lu H, et al. PBiTree coding and efficient processing of containment join [C]//Proceedings of the 19th International Conference
on Data Engineering. Washington, DC, USA: IEEE, 2003: 391-402.
[7] Amagasa T, Yoshikawa M, Uemura S. A robust numbering scheme for XML documents[C]//Proceedings of the 19th International Conference
on Data Engineering. Washington, DC, USA: IEEE,2003: 705-707.
[8] O’neil P, O’neil E, Pal S, et al. ORDPATHs:Insert-friendly XML node labels [C]//Proceedings of the ACM SIGMOD International Conference on Management
of Data. New York, USA: ACM. 2004: 903-908.
[9] Wu X, Lee M L, Hsu W. A prime number labeling scheme for dynamic ordered XML trees[C]//Proceedings of the 20th International Conference
on Data Engineering. Washington, DC, USA: IEEE, 2004: 66-78.
[10] Li C Q, Ling T W, Hu M. Efficient updates in dynamic XML data: From binary string to quaternary string [J]. The VLDB Journal, 2008, 17(3): 573-601.
[11] Xu L, Bao Z F, Ling T W. A dynamic labeling scheme using vectors [C]//Proceedings of the 18th International Conference on Database and Expert
Systems Applications (DEXA 2007). Heidelberg: Springer-Verlag, 2007: 130-140.
