1 / 10

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

Review of report "LSDX: A New Labeling Scheme for Dynamically Updating XML Data". Introduction. Any Problem there? Here is A Solution!. Motivation. Several path indexing, labeling and number scheme have been introduced to facilitate query processing for XML data

niles
Download Presentation

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

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


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

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

  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. Aim • Aim: To provide fast query processing for dynamic XML data • Fast update • Fast searching • Fast insertion and deletion

  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. Key Findings • Improvement in performance • Length of labels • Time used to generate labels • Time used in insertion and deletion • Relationship suggestion • ability to show different relationships • Tree depth indication • Indication of tree depth of nodes

  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. Prove in Practice 1 • Experiments • Length of Labels: much shorter than The two previous major schemas (GRP, SP) • Time used to generate labels: one second for 1.2MB, one minute for 100MB

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

  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

More Related