1. 1 Review of report "LSDX: A New Labeling Scheme for Dynamically Updating XML Data"

2. 2 Introduction Any Problem there? Here is A Solution!

3. 3 Motivation Several path indexing, labeling and number scheme have been introduced to facilitate query processing for XML data Most of these approaches need to re- compute existing labels – time consuming Want to implement a new Labeling Scheme for Dynamic XML data (LSDX) that  Supports updating XML data without re- labeling existing labels  Supports the representation of relationships between nodes

4. 4 Aim Aim: To provide fast query processing for dynamic XML data - Fast update - Fast searching - Fast insertion and deletion

5. 5 Aim Cont To meet the aim, a new labeling scheme is proposed to: - Eliminate overhead of re-labeling existing nodes -> fast insertion and update - Fast search and response to structural queries, e.g. relationship between nodes, by having more information on labels

6. 6 Key Findings Improvement in performance 1. Length of labels 2. Time used to generate labels 3. Time used in insertion and deletion Relationship suggestion  ability to show different relationships Tree depth indication  Indication of tree depth of nodes

7. 7 Prove in Theory Algorithm for indexing  The red-black tree (a.k.a. symmetric binary B-tree ) is employed, which shall guarantee that basic operations take log(n) time in the worst case

8. 8 Prove in Practice 1 Experiments 1. Length of Labels: much shorter than The two previous major schemas (GRP, SP) 2. Time used to generate labels: one second for 1.2MB, one minute for 100MB

9. 9 Prove in Practice 2 3. Insertion and Deletion Time: Updating XML date is relatively fast without the effort of re-labeling

10. 10 Summary LSDX is the new labeling scheme introduced in the paper  3 main features Review  We have pointed out some basic information about LSDX  Found the key points of the report