DocumentCode
2621426
Title
Storage mode of the dynamic ordered tree
Author
Te, Rigen ; Li, Wei ; Li, Xiongfei ; Zhang, Yueying
Author_Institution
Symbol Comput. & Knowledge Eng. of Minist. of Educ., Jilin Univ., Changchun, China
fYear
2011
fDate
27-29 June 2011
Firstpage
2591
Lastpage
2596
Abstract
In the storage of the ordered tree, for two weaknesses (the XML document is large and the space-efficient LOUDS bit-string can only describe static trees), the space-efficient-tree package format based on the LOUDS bit-string is proposed. This package format can not only store ordered trees space-efficiently, but also achieve the dynamic operations of ordered trees. In the end, a variety of common operations of dynamic trees are designed. And it indicates that space-efficient storage of dynamic ordered trees can be achieved by this structure.
Keywords
XML; storage management; tree data structures; LOUDS bit-string; XML document; dynamic operation; dynamic ordered tree; dynamic trees; space-efficient-tree package; static trees; storage mode; Algorithm design and analysis; Complexity theory; Data mining; Data models; Encoding; Memory; XML; LOUDS; dynamic trees; ordered tree; package; space-efficient;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-9762-1
Type
conf
DOI
10.1109/CSSS.2011.5974732
Filename
5974732
Link To Document