Efficient updates in dynamic XML data: from binary string to quaternary string

Li, Changqing; Ling, Tok Wang; Hu, Min

doi:10.1007/s00778-006-0021-2

Cited by 45 publications

(39 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1) which is compatible with the document order (we use the pre-order traversal number). For frequently updated XML data, we can use the encoding scheme of [14] to assign a unique ID to each node.…”

Section: A Data Modelmentioning

confidence: 99%

Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection

Zhou

Bao

Wang

et al. 2012

2012 IEEE 28th International Conference on Data Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which includes IDs of nodes that directly or indirectly contain the keyword. We propose a family of efficient algorithms that are based on the set intersection operation for both semantics. We show that the problem of SLCA/ELCA computation becomes finding a set of nodes that appear in all involved inverted lists and satisfy certain conditions. We also propose several optimization techniques to further improve the query processing performance. We have conducted extensive experiments with many alternative methods. The results demonstrate that our proposed methods outperform existing ones by up to two orders of magnitude in many cases.

show abstract

Section: A Data Modelmentioning

confidence: 99%

Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection

Zhou

Bao

Wang

et al. 2012

2012 IEEE 28th International Conference on Data Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…QED (Li and Ling, 2005;Li et al, 2008) and CDBS (Li et al, 2006a) remove the need of relabeling the nodes when the XML document is updated. In addition, they can be applied to different labeling schemes which need to maintain the order.…”

Section: Introductionmentioning

confidence: 99%

“…Relabeling the existing nodes is not required in the proposed algorithm. The QED (Li and Ling, 2005;Li et al, 2008) labeling approach is unable to guarantee inserting the labels with smallest size when some labels are deleted. Li et al (2006b) have suggested a reuse algorithm to modify QED labeling approach to find the smallest label lexicographically between two labels.…”

Section: Introductionmentioning

confidence: 99%

“…In order to overcome the overflow problem of CDBS, Compact Dynamic Quaternary String (CDQS) (Li et al, 2008) encoding approach is devised which is able to remove relabeling in updating the leaf node completely. CDQS also can be applied into different labeling schemes like CDBS and QED.…”

Section: Introductionmentioning

confidence: 99%

“…CDQS also can be applied into different labeling schemes like CDBS and QED. In addition, Li et al (2008) have proposed some techniques to update interval nodes efficiently but it is not able to completely remove the relabeling in interval node updates. In addition, to reuse all CDQS deleted labels, a new algorithm is devised.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Controlling Label Size Increment of Efficient XML Encoding and Labeling Scheme in Dynamic XML Update

Mirabi¹

2010

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:In order to facilitate XML query processing, labeling schemes are used to determine the structural relationships between XML nodes. However, labeling schemes have to reliable the existing nodes or recalculate the label values when a new node is inserted into the XML document during XML update process. EXEL as a labeling scheme is able to remove relabeling for existing nodes during XML update process. Also, it is able to compute the structural relationship between nodes effectively. However, for the case of skewed insertions where nodes are always inserted at a fixed place, the label size of EXEL scheme increases very fast. Approach: This study discussed how to control the increment of label size for the EXEL scheme. In addition, EXEL does not consider the process of deleting labels. We also study how to reuse the deleted labels for future label insertions. Results: We proposed an algorithm which is able to control the label size increment. Conclusion: It required less storage size to store the inserted binary bit string and thus can improve query performance.

show abstract

OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data

Cai

Poon

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Efficient updates in dynamic XML data: from binary string to quaternary string

Cited by 45 publications

References 32 publications

Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection

Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection

Controlling Label Size Increment of Efficient XML Encoding and Labeling Scheme in Dynamic XML Update

OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data

Contact Info

Product

Resources

About