1 / 11

Querying and Maintaining Ordered XML Data using Relational Databases

Querying and Maintaining Ordered XML Data using Relational Databases. Anil Rawat Wei Pan Chang chen Kelly Yu. Motivation.

calvin
Download Presentation

Querying and Maintaining Ordered XML Data using Relational Databases

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. Querying and Maintaining Ordered XML Data using Relational Databases Anil Rawat Wei Pan Chang chen Kelly Yu

  2. Motivation • XML is being used increasingly often for the exchange of data form heterogeneous data sources. But at present, most business is stored in relational databases, due to the decades of research have been put into the field. • How to harness the versatility of the XML data model with minimal modifications to the mechanisms of relational databases?This paper proposes an efficient structural join algorithm that can be implemented on top of existing relational database.

  3. Aim of the work We mainly introduce a new labeling scheme (XRU) and a new structural join algorithm (SS-Join) that have been presented in the Querying and Maintaining Ordered XML Data using Relational Databases(William M. Shui, Franky Lam, Damien K. Fisher& Raymond K.Wong, 2005). The method is not based on the B-Tree or Stack, and do not use the indices ,just using a edge table that is stored in the relational database.

  4. Result of the new approaches • In XRU random insertion of nodes using local encoding scheme is generally faster than both Dewey and global encoding schemes • worst case of XRU using local encoding scheme is the same as that of global encoding scheme

  5. Result of the new approaches • XRU vs optimistic • compare the time and the number of relabelings • XRU significantly better

  6. Result of the new approaches • SS-Join • Better when selectivity between low and medium • Little bit worse than XR-Tree when the selectivity is high • The SS-join have to spend add extra overhead on join operation

  7. Result of the new approaches • successfully built two new approaches which are XRU Relabeling scheme and SS-join algorithm

  8. Experiments • XRU relabeling scheme • Global edge table • local edge table (best order maintenance performance)

  9. Performance results • Performance of relabeleing scheme • Global encoding scheme • Local encoding scheme • XRU vs. Optimistic

  10. Performance of querying XML • Performance of SS-D algorithm w.r.t. other structural join algorithms • Performance of SS-A algorithm w.r.t. other structural join algorithms

  11. Summary of the results • The XRU relabeling scheme achieves O (log n) cost for random and frequent insertions. • The SS-A and SS-D algorithm proposed in this paper outperform all other structural join algorithms.

More Related